Algorithms and Complexity for Congested Assignments

Jiehua Chen, Jiong Guo, Yinghui Wen

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.