Algorithms and Complexity for Congested Assignments
Computer Science and Game Theory
2023-12-13 v1 Computational Complexity
Data Structures and Algorithms
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.
Cite
@article{arxiv.2312.07431,
title = {Algorithms and Complexity for Congested Assignments},
author = {Jiehua Chen and Jiong Guo and Yinghui Wen},
journal= {arXiv preprint arXiv:2312.07431},
year = {2023}
}