Year: 2023
Type: preprint
Abstract: We study the congested assignment problem as introduced by Bogomolnaia and Moulin (2023). We show that deciding whether a competitive assignment exists can be done in polynomial time, while deciding whether an envy-free assignment exists is NP-complete.
Source: arXiv (Cornell University)
Authors: Chen, Jiehua, Guo, Jiong, Wen, Yinghui
Institutions: TU Wien, Shandong University
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W4389712816