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 \(\tfrac{1}{2}\)-competitive on accommodating sequences, when there are at least three seats.
Additionally, we give an asymptotic upper bound of \(\tfrac{7}{9}\) 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Awerbuch, B., Y. Bartal, A. Fiat, and A. Rosén, “Competitive non-preemptive call control,” in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, 1994, pp. 312-320.
Awerbuch, B., Y. Bartal, A. Fiat, S. Leonardi, and A. Rosén, “On-line competitive algorithms for call admission in optical networks,” in Proc. 4th Annu. Eur. Symp. on Algorithms, Lecture Notes in Computer Science 1136, Springer-Verlag, 1996, pp. 431-444.
Bach, E., J. Boyar, and K.S. Larsen, The Accommodating Ratio for the Seat Reservation Problem, PP-1997-25, Department of Mathematics and Computer Science, University of Southern Denmark, 1997.
Bach, E., J. Boyar, T. Jiang, K.S. Larsen, and G.-H. Lin, “Better bounds on the accommodating ratio for the seat reservation problem,” in Proc. 6th Annu. Int. Computing and Combinatorics Conference, Lecture Notes in Computer Science 1858, Springer-Verlag, 2000, pp. 221-231.
Bar-Noy, A., R. Canetti, S. Kutten, Y. Mansour, and B. Schieber, “Bandwidth allocation with preemption,” in Proc. 27th Annu. ACM Symp. on Theory of Computing, ACM Press, 1995, pp. 616-625.
Boyar, J. and K.S. Larsen, “The seat reservation problem,” Algorithmica, 25, 403-417 (1999). Full paper to appear in SIAM J. Computing.
Boyar, J., K.S. Larsen, and M.N. Nielsen, “The accommodating function—a generalization of the competitive ratio,” in Proc. 6th Int. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 1663, Springer-Verlag, 1999, pp. 74-79.
Carlisle, M.C. and E. L. Lloyd, “On the k-coloring of intervals,” in Advances in Computing and Information, Lecture Notes in Computer Science 497, Springer-Verlag, 1991, pp. 90-101.
Garay, J. A., I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung, “Efficient on-line call control algorithms,” J. Algorithms, 23, 180-194 (1997).
Gavril, F., “Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph,” SIAM J. Computing, 1, 180-187 (1972).
Jensen, T. R. and B. Toft, Graph Coloring Problems, Wiley, 1995.
Kierstead, H. A. and W. T. Trotter Jr, “An extremal problem in recursive combinatorics,” Congressus Numerantium, 33, 143-153 (1981).
Lipton, R. J. and A. Tomkins, “On-line interval scheduling,” in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms, ACM Press, 1994, pp. 302-311.
Raghavan, P. and E. Upfal, “Efficient routing in all-optical networks,” in Proc. 26th Annu. ACM Symp. on Theory of Computing, ACM Press, 1994, pp. 134-143.
van Wassenhove, L., L. Kroon, and M. Salomon, “Exact and approximation algorithms for the operational fixed interval scheduling problem,” Working paper 92/08/TM, INSEAD, Fontainebleau, France, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bach, E., Boyar, J., Epstein, L. et al. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. Journal of Scheduling 6, 131–147 (2003). https://doi.org/10.1023/A:1022985808959
Issue Date:
DOI: https://doi.org/10.1023/A:1022985808959