Stable Matching with Evolving Preferences
We consider the problem of stable matching with dynamic preference lists. At each time-step, the preference list of some player may change by swapping random adjacent members. The goal of a central agency (algorithm) is to maintain an approximately stable matching, in terms of number of blocking pairs, at all time-steps. The changes in the preference lists are not reported to the algorithm, but must instead be probed explicitly. We design an algorithm that in expectation and with high probability maintains a matching that has at most O((log n)^2 blocking pairs.
Stable Matching
Dynamic Data
36:1-36:13
Regular Paper
Varun
Kanade
Varun Kanade
Nikos
Leonardos
Nikos Leonardos
Frédéric
Magniez
Frédéric Magniez
10.4230/LIPIcs.APPROX-RANDOM.2016.36
A. Anagnostopoulos, R. Kumar, M. Mahdian, and E. Upfal. Sorting and selection on dynamic data. Theoretical Computer Science, 412(24):2564-2576, 2011. Selected Papers from 36th International Colloquium on Automata, Languages and Programming. URL: http://dx.doi.org/10.1016/j.tcs.2010.10.003.
http://dx.doi.org/10.1016/j.tcs.2010.10.003
A. Anagnostopoulos, R. Kumar, M. Mahdian, E. Upfal, and F. Vandin. Algorithms on evolving graphs. In Proc. of 3rd Innovations in Theoretical Computer Science, 2012.
D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 8. CRC Press, 1999.
D. Gale and L. S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly, 69(1):9-15, 1962.
M. Gupta and R. Peng. Fully dynamic (1+ e)-approximate matchings. In Proc. of 54th IEEE Foundations of Computer Science, pages 548-557, Oct 2013. URL: http://dx.doi.org/10.1109/FOCS.2013.65.
http://dx.doi.org/10.1109/FOCS.2013.65
D. Knuth. Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms. CRM proceedings &lecture notes. American Mathematical Society, 1997.
David Asher Levin, Yuval Peres, and Elizabeth Lee Wilmer. Markov Chains and Mixing Times. American Mathematical Society, 2009.
C. McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, volume 16 of Algorithms and Combinatorics, pages 195-248. Springer Berlin Heidelberg, 1998. URL: http://dx.doi.org/10.1007/978-3-662-12788-9_6.
http://dx.doi.org/10.1007/978-3-662-12788-9_6
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge International Series on Parallel Computation. Cambridge University Press, 1995.
O. Neiman and S. Solomon. Simple deterministic algorithms for fully dynamic maximal matching. In Proc. of 45th ACM Symposium on Theory of Computing, pages 745-754, 2013. URL: http://dx.doi.org/10.1145/2488608.2488703.
http://dx.doi.org/10.1145/2488608.2488703
K. Onak and R. Rubinfeld. Maintaining a large matching and a small vertex cover. In Proc. of 42nd ACM Symposium on Theory of Computing, pages 457-464, 2010. URL: http://dx.doi.org/10.1145/1806689.1806753.
http://dx.doi.org/10.1145/1806689.1806753
L. B. Wilson. An analysis of the stable marriage assignment algorithm. BIT Numerical Mathematics, 12(4):569-575, 1972.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode