Size versus truncation robustness in the assignment problem

DOI10.1016/J.JMATECO.2019.12.001zbMath1436.91089OpenAlexW2890695238MaRDI QIDQ1985723

Shunya Noda

Publication date: 7 April 2020

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2019.12.001

zbMATH Keywords

maximum matchingstrategy-proofnessrandom assignmentrandom mechanismweak truncation robustness

Mathematics Subject Classification ID

Matching models (91B68)

Related Items (2)

A planner-optimal matching mechanism and its incentive compatibility in a restricted domain ⋮ Tight social welfare approximation of probabilistic serial

Cites Work

• Strategy-proof stochastic assignment
• On cores and indivisibility
• Size versus fairness in the assignment problem
• Kidney Exchange
• Two axiomatic approaches to the probabilistic serial mechanism
• Random Matching Under Dichotomous Preferences
• College Admissions and the Stability of Marriage
• A new solution to the random assignment problem.

This page was built for publication: Size versus truncation robustness in the assignment problem