3 search results - page 1 / 1 » Fair Division under Ordinal Preferences: Computing Envy-Free... |
84
Voted
ECAI
2010
Springer
14 years 11 months ago
2010
Springer
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...
103
click to vote
AAAI
2011
13 years 10 months ago
2011
We consider the problem of fairly dividing a heterogeneous divisible good among agents with different preferences. Previous work has shown that envy-free allocations, i.e., where...
JAIR
2008
14 years 10 months ago
2008
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...