A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
On approximately fair allocations of indivisible goods
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Distributed task allocation in social networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Combinatorial auctions with k-wise dependent valuations
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Methods for task allocation via agent coalition formation
Artificial Intelligence
The complexity of contract negotiation
Artificial Intelligence
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Optimal partitions in additively separable hedonic games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Computing desirable partitions in additively separable hedonic games
Artificial Intelligence
A matroid approach to the worst case allocation of indivisible goods
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficiency and fairness in resource allocation problems: we prove that the problem of deciding whether a given allocation is Pareto-optimal is coNP-complete, and that the problem of deciding whether there is a Pareto-efficient and envy-free allocation is $\Sigma_2^p$-complete.