Three New Complexity Results for Resource Allocation Problems

Simple item page
dc.creatorde Keijzer, Bart
dc.date2008-10-02
dc.date2008-10-17
dc.date.accessioned2026-07-07T10:10:34Z
dc.date.available2026-07-07T10:10:34Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0810.0532
dc.identifierhttp://arxiv.org/abs/0810.0532
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171632
dc.subjectMultiagent Systems
dc.subjectArtificial Intelligence
dc.subjectComputational Complexity
dc.subjectComputer Science and Game Theory
dc.titleThree New Complexity Results for Resource Allocation Problems
dc.typetext

Files

Collections

arXiv