Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem |
| |
| Authors: | Eric Bach Joan Boyar Leah Epstein Lene M Favrholdt Tao Jiang Kim S Larsen Guo-Hui Lin Rob van Stee |
| |
| Affiliation: | (1) Computer Sciences Department, University of Wisconsin – Madison, 1210 West Dayton Street, Madison, WI 53706-1685, USA;(2) Department of Mathematics and Computer Science, University of Southern Denmark, Main Campus: Odense University, Campusvej 55, DK-5230 Odense M, Denmark;(3) School of Computer and Media Sciences, The Interdisciplinary Center, P.O. Box 167, 46150 Herzliya, Israel;(4) Centre for Mathematics and Computer Science (CWI), P.O. Box 94079, 1090 GB Amsterdam, The Netherlands |
| |
| Abstract: | The unit price seat reservation problem is investigated. The seat reservation problem is the problem of assigning seat numbers on-line to requests for reservations in a train traveling through k stations. We are considering the version where all tickets have the same price and where requests are treated fairly, that is, a request which can be fulfilled must be granted.For fair deterministic algorithms, we provide an asymptotically matching upper bound to the existing lower bound which states that all fair algorithms for this problem are
-competitive on accommodating sequences, when there are at least three seats.Additionally, we give an asymptotic upper bound of
for fair randomized algorithms against oblivious adversaries.We also examine concrete on-line algorithms, First-Fit and Random for the special case of two seats. Tight analyses of their performance are given. |
| |
| Keywords: | competitive ratio accomodating sequences on-line algorithms seat reservation problem |
| 本文献已被 SpringerLink 等数据库收录！ |
|
