Abstract
Motivated by applications in online dating and kidney exchange, we study a stochastic matching problem in which we have a random graph G given by a node set V and probabilities p(i,j) on all pairs i,j ∈ V representing the probability that edge (i,j) exists. Additionally, each node has an integer weight t(i) called its patience parameter. Nodes represent agents in a matching market with dichotomous preferences, i.e., each agent finds every other agent either acceptable or unacceptable and is indifferent between all acceptable agents. The goal is to maximize the welfare, or produce a matching between acceptable agents of maximum size. Preferences must be solicited based on probabilistic information represented by p(i,j), and agent i can be asked at most t(i) questions regarding his or her preferences.
A stochastic matching algorithm iteratively probes pairs of nodes i and j with positive patience parameters. With probability p(i,j), an edge exists and the nodes are irrevocably matched. With probability 1 − p(i,j), the edge does not exist and the patience parameters of the nodes are decremented. We give a simple greedy strategy for selecting probes which produces a matching whose cardinality is, in expectation, at least a quarter of the size of this optimal algorithm’s matching. We additionally show that variants of our algorithm (and our analysis) can handle more complicated constraints, such as a limit on the maximum number of rounds, or the number of pairs probed in each round.
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
http://www.aakp.org/aakp-library/transplant-compatibility/index.cfm
http://www.online-family-doctor.com/medical-tests/crossmatching.html
Abdulkadiroglu, A., Pathak, P.A., Roth, A.E.: The new york city high school match. American Economic Review 95(2), 364–367 (2005)
Abdulkadiroglu, A., Pathak, P.A., Roth, A.E., Sonmez, T.: The boston public school match. American Economic Review 95(2), 368–371 (2005)
Abdulkadiroglu, A., Sonmez, T.: School choice: A mechanism design approach. American Economic Review 93(3), 729–747 (2003)
Bogomolnaia, A., Moulin, H.: Random matching under dichotomous preferences. Econometrica 72(1), 257–279 (2004)
Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic shortest paths via quasi-convex maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 552–563. Springer, Heidelberg (2006)
Dean, B., Goemans, M., Vondrak, J.: Approximating the stochastic knapsack: the benefit of adaptivity. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 208–217 (2004)
Epstein, R.: The truth about online dating. Scientific American (February 2007)
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science 84(1), 127–150 (1991)
Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics (2005)
Rapaport, F.T.: The case for a living emotionally related international kidney donor exchange registry. Transplantation Proceedings 18, 5–9 (1986)
Ross, L.F., Rubin, D.T., Siegler, M., Josephson, M.A., Thistlethwaite, J.R., Woodle, E.S.: Ethics of a paired-kidney-exchange program. The New England Journal of Medicine 336(24), 1752–1755 (1997)
Roth, A.E.: The evolution of the labor market for medical interns and residents: A case study in game theory. Journal of Economic Theory 92, 991–1016 (1984)
Roth, A.E., Sonmez, T., Unver, U.: Kidney exchange. Quarterly Journal of Economics 119(2), 457–488 (2004)
Roth, A.E., Sonmez, T., Unver, U.: Pairwise kidney exchange. Journal of Economic Theory 125(2), 151–188 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, N., Immorlica, N., Karlin, A.R., Mahdian, M., Rudra, A. (2009). Approximating Matches Made in Heaven. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02927-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-02927-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02926-4
Online ISBN: 978-3-642-02927-1
eBook Packages: Computer ScienceComputer Science (R0)