Abstract
In the seat reservation problem, there are k stations, s 1 through s k , and one train with n seats departing from the station s 1 and arriving at the station s k . Each passenger orders a ticket from station s i to station s j (1 ≤ i < j ≤ k) by specifying i and j. The task of an online algorithm is to assign one of n seats to each passenger online, i.e., without knowing future requests. The purpose of the problem is to maximize the total price of the sold tickets. There are two models, the unit price problem and the proportional price problem, depending on the pricing policy of tickets. In this paper, we improve upper and lower bounds on the competitive ratios for both models: For the unit price problem, we give an upper bound of \(\frac{4}{k-2\sqrt{k-1}+4}\), which improves the previous bound of \(\frac{8}{k+5}\). We also give an upper bound of \(\frac{2}{k-2\sqrt{k-1}+2}\) for the competitive ratio of Worst-Fit algorithm, which improves the previous bound of \(\frac{4}{k-1}\). For the proportional price problem, we give upper and lower bounds of \(\frac{3+\sqrt{13}}{k-1+\sqrt{13}} (\simeq \frac{6.6}{k+2.6})\) and \(\frac{2}{k-1}\), respectively, on the competitive ratio, which improves the previous bounds of \(\frac{4+2\sqrt{13}}{k+3+2\sqrt{13}} (\simeq \frac{11.2}{k+10.2})\) and \(\frac{1}{k-1}\), respectively.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bach, E., Boyar, J., Epstein, L., Favrholdt, L.M., Jiang, T., Larsen, K.S., Lin, G.-H., Van Stee, R.: Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem. Journal of Scheduling 6(2), 131–147 (2003)
Boyar, J., Favrholdt, L.M., Larsen, K.S., Nielsen, M.N.: Extending the accommodating function. Acta Informatica 40(1), 3–35 (2003)
Boyar, J., Krarup, S., Nielsen, M.N.: Seat reservation allowing seat changes. Journal of Algorithms 52(2), 169–192 (2004)
Boyar, J., Larsen, K.S.: The seat reservation problem. Algorithmica 25(4), 403–417 (1999)
Boyar, J., Larsen, K.S., Nielsen, M.N.: The accommodating function: a generalization of the competitive ratio. SIAM Journal on Computing 31(1), 233–258 (2001)
Boyar, J., Medvedev, P.: The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms 4(4) (2008) Article No. 48
Kohrt, J.S., Larsen, K.S.: Online seat reservation via offline seating arrangements. International Journal of Foundations of Computer Science 16(2), 381–397 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Miyazaki, S., Okamoto, K. (2010). Improving the Competitive Ratios of the Seat Reservation Problem. In: Calude, C.S., Sassone, V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15240-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15239-9
Online ISBN: 978-3-642-15240-5
eBook Packages: Computer ScienceComputer Science (R0)