Abstract
We consider a new variant of the Seat Reservation Problem [4]in which seat changes are allowed. We analyze the problem using the competitive ratio and the competitive ratio on accommodating sequences [4]. A very promising algorithm defined in this paper is Min-Change, which will ask passengers to change seat, only if they would otherwise have been rejected. Min-Change belongs to a large class of conservative algorithms, for which we prove very high performance guarantees. For instance when assuming that all of the passengers could have been seated by an optimal off-line algorithm, at least 2 3 of the passengers can be seated on-line with only one seat change and at least 3 4 will be seated if two seat changes are allowed. This should be compared to the performance guarantee of 1 2 for the best deterministic on-line algorithm when no seat changes are allowed [2].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
