There is a heterogeneous resource that contains both good parts and bad parts, for example,
a cake with some parts burnt, a land-estate with some parts heavily taxed, or a chore with …

A matching in a bipartite graph with parts X and Y is called envy-free, if no unmatched vertex
in X is a adjacent to a matched vertex in Y . Every perfect matching is envy-free, but envy-…

We study fair allocation of indivisible goods among additive agents with feasibility constraints.
In these settings, every agent is restricted to get a bundle among a specified set of feasible …

We study the problem of fairly allocating indivisible goods to groups of agents. Agents in the
same group share the same set of goods even though they may have different preferences. …

To date, a variety of automated negotiation agents have been created. While each of these
agents has been shown to be effective in negotiating with people in specific environments, …

We revisit the setting of fairly allocating indivisible items when agents have different weights
representing their entitlements. First, we propose a parameterized family of relaxations for …

We consider allocating indivisible chores among agents with different cost functions, such
that all agents receive a cost of at most a constant factor times their maximin share. The state-of…

We study monotonicity properties of solutions to the classic problem of fair cake-cutting—dividing
a heterogeneous resource among agents with different preferences. Resource- and …

We consider the problem of fair division of a two dimensional heterogeneous good among
several agents. Applications include division of land as well as ad space in print and …

The paper considers fair allocation of resources that are already allocated in an unfair way.
This setting requires a careful balance between the fairness considerations and the rights of …