Three New Complexity Results for Resource Allocation Problems
Multiagent Systems
2008-10-17 v2 Artificial Intelligence
Computational Complexity
Computer Science and Game Theory
Abstract
We prove the following results for task allocation of indivisible resources: - The problem of finding a leximin-maximal resource allocation is in P if the agents have max-utility functions and atomic demands. - Deciding whether a resource allocation is Pareto-optimal is coNP-complete for agents with (1-)additive utility functions. - Deciding whether there exists a Pareto-optimal and envy-free resource allocation is Sigma_2^p-complete for agents with (1-)additive utility functions.
Cite
@article{arxiv.0810.0532,
title = {Three New Complexity Results for Resource Allocation Problems},
author = {Bart de Keijzer},
journal= {arXiv preprint arXiv:0810.0532},
year = {2008}
}