Compatibility between Stability and Strategy-Proofness: A Single-Peaked Preferences Investigation

Pinaki Mandal

Papers from arXiv.org

Abstract: In two-sided matching markets, ensuring both stability and strategy-proofness poses a significant challenge; it is impossible when agents' preferences are unrestricted. But what if agents' preferences have specific restricted structures? Such scenarios frequently arise in real-world applications. This study explores the possibility of achieving both stability and strategy-proofness by focusing on scenarios where agents' preferences follow a structured pattern called single-peakedness. We focus on the simplest case - the well-known marriage problem, which is a one-to-one matching market. Despite its simplicity, this model is a useful starting point for exploration in many cases. Our main contribution is identifying all single-peaked subdomains on which stability and (weak/strong group) strategy-proofness are compatible, which we present through two key results. The first one characterizes all single-peaked subdomains with stable and (weakly group) strategy-proof matching rules, and identifies such a matching rule on these domains. The second one is an impossibility result that shows the incompatibility between stability and strong group strategy-proofness on single-peaked subdomains.

Date: 2023-04, Revised 2025-05
New Economics Papers: this item is included in nep-des and nep-mic
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2304.11494 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2304.11494

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().