Sciweavers

15 search results - page 1 / 3
» On approximately fair allocations of indivisible goods
Sort
View
85
Voted
STOC
2007
ACM
164views Algorithms» more  STOC 2007»
16 years 1 months ago
An approximation algorithm for max-min fair allocation of indivisible goods
Arash Asadpour, Amin Saberi
SIGECOM
2004
ACM
100views ECommerce» more  SIGECOM 2004»
15 years 6 months ago
On approximately fair allocations of indivisible goods
Richard J. Lipton, Evangelos Markakis, Elchanan Mo...
88
Voted
ALDT
2009
Springer
149views Algorithms» more  ALDT 2009»
15 years 4 months ago
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
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 efficienc...
Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yin...
96
Voted
ECAI
2010
Springer
15 years 1 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...
JAIR
2008
145views more  JAIR 2008»
15 years 20 days ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang