A performance guarantee for the greedy set-partitioning algorithm
Acta Informatica
Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximation algorithms
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient Approximation Algorithms for the Subset-Sums Equality Problem
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
Allocation of indivisible goods: a general model and some complexity results
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
ACM SIGecom Exchanges
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An efficient mechanism for auctioning alternative paths
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
An approximation algorithm for max-min fair allocation of indivisible goods
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity
Proceedings of the 8th ACM conference on Electronic commerce
On the importance of migration for fairness in online grid markets
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the importance of migration for fairness in online grid markets
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Allocating goods on a graph to eliminate envy
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Negotiating socially optimal allocations of resources
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Reaching envy-free states in distributed negotiation settings
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficiency and envy-freeness in fair division of indivisible goods
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Making decisions based on the preferences of multiple agents
Communications of the ACM
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
On Low-Envy Truthful Allocations
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
On Multi-dimensional Envy-Free Mechanisms
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
The Efficiency of Fair Division
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Envy-Free Allocations for Budgeted Bidders
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A general branch-and-bound algorithm for fair division problems
Computers and Operations Research
Complexity of social welfare optimization in multiagent resource allocation
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
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
Online stochastic packing applied to display ad allocation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
Some representation and computational issues in social choice
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Egalitarian allocations of indivisible resources: theory and computation
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
Beyond dominant resource fairness: extensions, limitations, and indivisibilities
Proceedings of the 13th ACM Conference on Electronic Commerce
Optimal partitions in additively separable hedonic games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Computing desirable partitions in additively separable hedonic games
Artificial Intelligence
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Cake cutting: not just child's play
Communications of the ACM
Reduction of economic inequality in combinatorial domains
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Envy-ratio and average-nash social welfare optimization in multiagent resource allocation
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
A matroid approach to the worst case allocation of indivisible goods
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Autonomous Agents and Multi-Agent Systems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.03 |
We study the problem of fairly allocating a set of indivisible goods to a set of people from an algorithmic perspective. fair division has been a central topic in the economic literature and several concepts of fairness have been suggested. The criterion that we focus on is envy-freeness. In our model, a monotone utility function is associated with every player specifying the value of each subset of the goods for the player. An allocation is envy-free if every player prefers her own share than the share of any other player. When the goods are divisible, envy-free allocations always exist. In the presence of indivisibilities, we show that there exist allocations in which the envy is bounded by the maximum marginal utility, and present a simple algorithm for computing such allocations. We then look at the optimization problem of finding an allocation with minimum possible envy. In the general case the problem is not solvable or approximable in polynomial time unless P = NP. We consider natural special cases (e.g.additive utilities) which are closely related to a class of job scheduling problems. Approximation algorithms as well as inapproximability results are obtained. Finally we investigate the problem of designing truthful mechanisms for producing allocations with bounded envy.