Fast Distributed Almost Stable Matchings
暂无分享,去创建一个
[1] David Manlove,et al. "Almost Stable" Matchings in the Roommates Problem , 2005, WAOA.
[2] Boaz Patt-Shamir,et al. Brief announcement: a note on distributed stable matching , 2009, PODC '09.
[3] Avinatan Hassidim,et al. Local computation mechanism design , 2013, EC.
[4] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[5] Alon Itai,et al. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..
[6] David Manlove,et al. Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.
[7] ALADAR FLEISCHMAN. A Note on Distributed Stable Matching , 2008 .
[8] Valentin Polishchuk,et al. Almost Stable Matchings by Truncating the Gale–Shapley Algorithm , 2009, Algorithmica.
[9] Alessandro Panconesi,et al. On the distributed complexity of computing maximal matchings , 1997, SODA '98.
[10] Martin Dyer,et al. The Stable Marriage Problem: Structure and Algorithms , 1991 .
[11] L. S. Shapley,et al. College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..
[12] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[13] Olle Häggström,et al. Instability of matchings in decentralized markets with various preference structures , 2008, Int. J. Game Theory.