Axiomatic characterizations of the constrained probabilistic serial mechanism

DOI10.1007/s11238-023-09925-zzbMath1524.91045OpenAlexW4361205250MaRDI QIDQ6054914

Mustafa Oǧuz Afacan

Publication date: 25 October 2023

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11238-023-09925-z

zbMATH Keywords

matchingcharacterizationaxiomclaimwise stabilityconstrained ordinal fairnessconstrained probabilistic serial

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• School choice with controlled choice constraints: hard bounds versus soft bounds
• Probabilistic assignment of objects: characterizing the serial rule
• Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
• A characterization of the extended serial correspondence
• Incentives in the probabilistic serial mechanism
• The object allocation problem with random priorities
• On characterizations of the probabilistic serial mechanism involving incentive and invariance properties
• Constrained random matching
• Essentially stable matchings
• Two axiomatic approaches to the probabilistic serial mechanism
• (Il)legal Assignments in School Choice
• College Admissions and the Stability of Marriage
• A new solution to the random assignment problem.
• Affirmative Action in India via Vertical, Horizontal, and Overlapping Reservations