Add to ORKGWe 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 each agent prefers its own allocation to any other, may not be efficient, in the sense of maximizing the total value of the agents. Our goal is to pinpoint the most efficient allocations among all envy-free allocations. We provide tractable algorithms for doing so under different assumptions regarding the preferences of the agents
We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represente...
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents ...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...
We consider the problem of fairly dividing a heteroge-neous divisible good among agents with differe...
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under t...
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under t...
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under t...
We study the problem of fair division of a heterogeneous resource among strategic players. Given a d...
For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a d...
This paper describes an algorithm to find an ((alpha))envy-free Pareto-optimal division in the case ...
We consider the problem of allocating fairly a set of indivisible goods among agents from the point ...
We consider the problem of fair division of a two dimensional heterogeneous good among several agent...
There have been several interesting results in the lit-erature on dividing up goods between self-int...
We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an ...
We study the problem of fairly allocating a set of indivis-ible goods to a set of people from an alg...
We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represente...
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents ...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...
We consider the problem of fairly dividing a heteroge-neous divisible good among agents with differe...
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under t...
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under t...
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under t...
We study the problem of fair division of a heterogeneous resource among strategic players. Given a d...
For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a d...
This paper describes an algorithm to find an ((alpha))envy-free Pareto-optimal division in the case ...
We consider the problem of allocating fairly a set of indivisible goods among agents from the point ...
We consider the problem of fair division of a two dimensional heterogeneous good among several agent...
There have been several interesting results in the lit-erature on dividing up goods between self-int...
We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an ...
We study the problem of fairly allocating a set of indivis-ible goods to a set of people from an alg...
We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represente...
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents ...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...