Weighted popular matchings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 715-726

  Mestre, Julián ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NUMBER THEORY; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

PERSONAL PREFERENCES; POPULAR MATCHING; TICS; TIME ALGORITHMS;

PATTERN MATCHING;

EID: 33746344359     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_62     Document Type: Conference Paper

References (10)

1. A. Abdulkadiroglu and T. Sönmez. Random serial dictatorship and the core from random endowments in house allocation problems. Econ., 66(3):689-701, 1998.
2. D. J. Abraham, K. Cechlarova, D. F. Manlove, and K. Mehlhorn. Pareto optimality in house allocation problems. In Proc. of ISAAC, pages 3-15, 2004.
3. D. J. Abraham, R. W. Irving, T. Kavitha, and K. Mehlhorn. Popular matchings. In Proc. of SODA, pages 424-432, 2005.
4. D. J. Abraham and T. Kavitha. Dynamic matching markets and voting paths. To appear in SWAT, 2006.
5. P. Gardenfors. Match making: assignments based on bilateral preferences. Behavioural Sciences, 20:166-173, 1975.
6. A. Hylland and R. Zeeckhauser. The efficient allocation of individuals to positions. Journal of Political Economy, 87(2):293-314, 1979.
7. R. W. Irving, T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch. Rank-maximal matchings. In Proc. of SODA, pages 68-75, 2004.
8. M. Mahdian. Random popular matchings. To appear in EC, 2006.
9. Y. Yuan. Residence exchange wanted: a stable residence exchange problem. European Journal of Operational Research, 90:536-546, 1996.
10. L. Zhou. On a conjecture by Gale about one-sided matching problems. Journal of Economic Theory, 52(1): 123-135, 1990.