Popular matchings
暂无分享,去创建一个
Kurt Mehlhorn | Telikepalli Kavitha | Robert W. Irving | David J. Abraham | K. Mehlhorn | David J. Abraham | T. Kavitha
[1] Montgomery Blair,et al. Least-Unpopularity-Factor Matching , 2007 .
[2] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[3] Atila Abdulkadiroglu,et al. RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .
[4] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[5] Lin Zhou. On a conjecture by gale about one-sided matching problems , 1990 .
[6] Andrew Postlewaite,et al. Weak Versus Strong Domination in a Market with Indivisible Goods , 1977 .
[7] Yufei Yuan,et al. Residence exchange wanted: A stable residence exchange problem , 1996 .
[8] Piotr Sankowski,et al. Maximum matchings via Gaussian elimination , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[9] Kurt Mehlhorn,et al. Pareto Optimality in House Allocation Problems , 2005, ISAAC.
[10] Mohammad Mahdian,et al. Random popular matchings , 2006, EC '06.
[11] Kurt Mehlhorn,et al. Rank-maximal matchings , 2004, TALG.
[12] Telikepalli Kavitha,et al. Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems , 2006, ISAAC.
[13] Martin Dyer,et al. The Stable Marriage Problem: Structure and Algorithms , 1991 .
[14] David Manlove,et al. Popular Matchings in the Capacitated House Allocation Problem , 2006, ESA.
[15] P. Hall. On Representatives of Subsets , 1935 .
[16] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[17] R. Zeckhauser,et al. The Efficient Allocation of Individuals to Positions , 1979, Journal of Political Economy.
[18] P. Gärdenfors. Match making: Assignments based on bilateral preferences , 1975 .