Maximal Domains for Strategy-Proof Pairwise Exchange

Thumbnail Image
Official URL
Full text at PDC
Publication Date
Advisors (or tutors)
Journal Title
Journal ISSN
Volume Title
Facultad de Ciencias Económicas y Empresariales. Instituto Complutense de Análisis Económico (ICAE)
Google Scholar
Research Projects
Organizational Units
Journal Issue
We analyze centralized non-monetary markets for indivisible objects through pairwise exchange when each agent initially owns a single object. We characterize a family of do- mains of preferences (minimal reversal domains) such that there exist pairwise exchange rules that satisfy individual rationality, efficiency, and strategy-proofness. Minimal reversal domains are maximal rich domains for individual rationality, efficiency, and strategy- proofness. Each minimal reversal domain is defined by a common ranking of the set of objects, and agents’ preferences over admissible objects coincide with such common rank- ing but for a specific pair of objects.
Abizada A (2019) Exchange-stability in roommate problems. Rev Econ Design, 23: 3-12. Alcalde J (1995) Exchange-proofness or divorce-proofness? Stability in one-sided markets. Econ Design, 1: 275-287. Alcalde J, Barberà S (1994) Top dominance and the possibility of strategy-proof stable solutions to matching problems. Econ Theory, 4: 417–435. Barberà S, Massó J, Neme A (1999) Maximal domains of preferences preserving strategy- proofness for generalized median voter schemes. Soc Choice Welfare, 16: 321–336. Barberà S, Sonnenschein H, Zhou L (1991) Voting by committees. Econometrica, 59: 595–609 16. Berga D, Serizawa S (2000) Maximal domain for strategy-proof rules with one public good. J Econ Theory, 90: 39–61. Ching S, Serizawa S (1998) A maximal domain for the existence of strategy-proof rules. J Econ Theory, 78: 157–166. Chung K (2000) On the existence of stable roommate matchings. Games Econ Behavior, 33: 206–230. Ehlers L (2002) Coalitional strategy-proof house allocation. J Econ Theory 105: 298–317. Ergin H (2002) Efficient Resource Allocation on the Basis of Priorities Econometrica 70: 2489–2497. Hatsumi K, Berga D, Serizawa S (2014) A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model. Int J Game Theory, 43: 153–168. Le Breton M, Sen A (1999) Separable preferences, strategy-proofness, and decomposability. Econometrica 67(3): 605–628. Ma J (1994) Strategy-proofness and the strict core in a market with indivisibilities. Int J Game Theory, 23:75–83. Massó J, Neme A (2001) Maximal domain of preferences in the division problem. Games Econ Behavior, 37: 367–387. Mizobuchi H, Serizawa S (2001) Maximal domain for strategy-proof rules in allotment economies. Soc Choice Welfare, 27: 195–210. Nicolò A, Rodríguez-Álvarez C (2012) Transplant quality and patients’ preferences in paired kidney exchange. Games Econ Behavior, 74: 299–310. Nicolò A, Rodríguez-Álvarez C (2013) Incentive compatibility and feasibility constraints in housing markets. Soc Choice Welfare, 41: 625–635. Nicolò A, Rodríguez-Álvarez C (2017) Age-based preferences in paired kidney exchange. Games Econ Behavior, 102: 508–524. Roth AE (1982) Incentive compatibility in a market with indivisible goods. Econ Letters, 9:127–132. Roth AE, Postlewaite A (1977) Weak versus strong domination in a market of indivisible goods. J Math Econ, 4: 131–137. Shapley L, Scarf H (1974) On cores and indivisibility. J Math Econ, 1:23–37. Sönmez T (1999) Strategy-proofness and essentially single-valued cores. Econometrica, 67: 677–689. Sönmez T, Ünver MU (2011) Matching, allocation, and exchange of discrete resources. In: Benhabib J, Bisin A, Jackson M (eds) Handbook of Social Economics. North Holland, pp:751–782. Wakayama T (2017) Bribe-proofness for single-peaked preferences: characterizations and maximality-of-domains results. Soc Choice Welfare, 49: 357-385.