Abstract
Motivated by the dynamics of the ever-popular online movie rental business, we study a range of assignment problems in rental markets. The assignment problems associated with rental markets possess a rich mathematical structure and are closely related to many well-studied one-sided matching problems. We formalize and characterize the assignment problems in rental markets in terms of one-sided matching problems, and consider several solution concepts for these problems. In order to evaluate and compare these solution concepts (and the corresponding algorithms), we define some “value” functions to capture our objectives, which include fairness, efficiency and social welfare. Then, we bound the value of the output of these algorithms in terms of the chosen value functions.
We also consider models of rental markets corresponding to static, online, and dynamic customer valuations. We provide several constant-factor approximation algorithms for the assignment problem, as well as hardness of approximation results for the different models. Finally, we describe some experiments with a discrete event simulator compare the various algorithms in a practical setting, and present some interesting experimental results.
This work was done when the authors were visiting Amazon.com.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, D., Cechlarov, K., Manlove, D.F., Mehlhorn, K.: Pareto Optimality in House-Allocation Problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 3–15. Springer, Heidelberg (2004)
Arkin, E.M., Hassin, R.: On Local Search for Weighted Packing Problems. Math. Oper. Res. 10(3), 640–648 (1998)
Avis, D.: A Survey of Heuristics for the Weighted Matching Problem. Networks 13, 475–493 (1983)
Gabow, H.N., Tarjan, R.E.: Faster Scaling Algorithms for Network Problems. SIAM Journal on Computing 18(5), 1013–1036 (1989)
Gale, D., Shapley, L.S.: College Admissions and the Stability of Marriage. American Mathematical Monthly 69, 9–15 (1962)
Goldberg, L., Paterson, M., Srinivasan, A., Sweedyk, E.: Better Approximation Guarantees for Job-Shop Scheduling. In: SODA 1997, pp. 599–608 (1997)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)
Holyer: The NP-Completeness of Some Edge Partitioning Problems. SIAM journal of Computing 10(3), 713–717 (1981)
Hopcroft, J.E., Karp, R.M.: An n 5/ 2 Algorithm for Maximum Matching in Bipartite Graphs. SIAM J. Computing 4, 225–231 (1973)
Immorlica, N., Mahdian, M., Mirrokni, V.S.: Cycle Cover with Short Cycles. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 641–653. Springer, Heidelberg (2005)
Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-Maximal Matchings. In: SODA 2004, pp. 68–75 (2004)
Irving, R.W.: Greedy Matchings. Technical Report TR-2003-136, University of Glasgow (2003)
Kann, V.: Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete. Inform. Process. Lett. 37, 27–35 (1991)
Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet Routing and Job-Shop Scheduling in O(Congestion +Dilation) Steps. Combinatorica 14(2), 167–180 (1994)
Mehlhorn, K., Michail, D.: Network Problems with Non-Polynomial Weights and Applications (manuscript, 2005)
Preis, R.: Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 259–269. Springer, Heidelberg (1999)
Shmoys, D.B., Stein, C., Wein, J.: Improved Approximation Algorithms for Shop Scheduling Problems. SIAM Journal of Computing 23, 617–632 (1994)
Williamson, D., Hall, L., Hoogeveen, J., Hurkens, C., Lenstra, J., Sevastianov, S., Shmoys, D.: Short Shop Schedules. Operations Research 45(2), 288–294 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abraham, D., Chen, N., Kumar, V., Mirrokni, V.S. (2006). Assignment Problems in Rental Markets. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944874_19
Download citation
DOI: https://doi.org/10.1007/11944874_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68138-0
Online ISBN: 978-3-540-68141-0
eBook Packages: Computer ScienceComputer Science (R0)