The fair allocation of resources to interested agents is a fundamental problem in society.
While the majority of the fair division literature assumes that all allocations are feasible, in …

A major problem in fair division is how to allocate a set of indivisible resources among
agents fairly and efficiently. The goal of this work is to characterize the tradeoffs between two …

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 …

We study the fair allocation of indivisible goods among agents with identical, additive
valuations but individual budget constraints. Here, the indivisible goods--each with a specific …

We study a fair division setting in which participants are to be fairly distributed among teams,
where not only do the teams have preferences over the participants as in the canonical fair …

We study fair division of goods under the broad class of generalized assignment constraints.
In this constraint framework, the sizes and values of the goods are agent-specific, and one …

We study a fair resource scheduling problem, where a set of interval jobs are to be allocated
to heterogeneous machines controlled by intellectual agents. Each job is associated with …

We consider the problem of fairly and efficiently allocating indivisible items (goods or bads)
under capacity constraints. In this setting, we are given a set of categorized items. Each …

The literature on fair division is so far predominantly focused on problems without budget
constraints (see, eg, a recent survey [1]), in which any partition of the item set is accepted as …

We are given a set of indivisible goods and a set of m agents where each good has a size
and each agent has an additive valuation function and a budget. The budgeted maximin …