Pareto optimality in house allocation problems

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

Volumn 3827 LNCS, Issue , 2005, Pages 1163-1175

  Abraham, David J ^a   Cechlárová, Katarína ^b   Manlove, David F ^c   Mehlhorn, Kurt ^d  

^a Carnegie Mellon University   (United States)

^b P J AFÁRIK UNIVERSITY   (Slovakia)

^c UNIVERSITY OF GLASGOW   (United Kingdom)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; LINEAR EQUATIONS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; RESOURCE ALLOCATION;

HOUSE ALLOCATION PROBLEMS; LINEAR TIME; PARETO OPTIMAL MATCHING;

PARETO PRINCIPLE;

EID: 33744965881     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_115     Document Type: Conference Paper

References (16)

1. A. Abdulkadiroǧlu and T. Sönmez. Random serial dictatorship and the core from random endowments in house allocation problems. Econometrica, 66(3):689-701, 1998.
2. A. Abdulkadiroǧlu and T. Sönmez. House allocation with existing tenants. Journal of Economic Theory, 88:233-260, 1999.
3. X. Deng, C. Papadimitriou, and S. Safra. On the complexity of equilibria. Journal of Computer and System Sciences, 67(2):311-324, 2003.
4. S.P. Fekete, M. Skutella, and G.J. Woeginger. The complexity of economic equilibria for house allocation markets. Inf. Proc. Lett., 88:219-223, 2003.
5. H.N. Gabow and R.E. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18(5):1013-1036, 1989.
6. J.D. Horton and K. Kilakos. Minimum edge dominating sets. SIAM Journal on Discrete Mathematics, 6:375-387, 1993.
7. 5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2:225-231, 1973.
8. A. Hylland and R. Zeckhauser. The efficient allocation of individuals to positions. Journal of Political Economy, 87(2):293-314, 1979.
9. B. Korte and D. Hausmann. An analysis of the greedy heuristic for independence systems. Annals of Discrete Mathematics, 2:65-74, 1978.
10. R.W. Irving, T. Kavitha, K. Mehlhorn, D. Michail, and K. Paluch. Rank-maximal matchings. Proceedings of SODA '04, pages 68-75. ACM-SIAM, 2004.
11. A.E. Roth. Incentive compatibility in a market with indivisible goods. Economics Letters, 9:127-132, 1982.
12. A.E. Roth and A. Postlewaite. Weak versus strong domination in a market with indivisible goods. Journal of Mathematical Economics, 4:131-137, 1977.
13. A.E. Roth and M.A.O. Sotomayor. Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press, 1990.
14. L. Shapley and H. Scarf. On cores and indivisibility. Journal of Mathematical Economics, 1:23-37, 1974.
15. Y. Yuan. Residence exchange wanted: a stable residence exchange problem. European Journal of Operational Research, 90:536-546, 1996.
16. L. Zhou. On a conjecture by Gale about one-sided matching problems. Journal of Economic Theory, 52(1):123-135, 1990.