We investigate the problem of fair recommendation in the context of two-sided online
platforms, comprising customers on one side and producers on the other. Traditionally …

Many online platforms today (such as Amazon, Netflix, Spotify, LinkedIn, and AirBnB) can be
thought of as two-sided markets with producers and customers of goods and services …

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 consider fair allocation of indivisible items in a model with goods, chores, and copies, as
a unified framework for studying:(1) the existence of EFX and other solution concepts for …

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 …

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 study the problem of fairly assigning a set of discrete tasks (or chores) among a set of
agents with additive valuations. Each chore is associated with a start and finish time, and …

In the budget-feasible allocation problem, a set of items with varied sizes and values are to
be allocated to a group of agents. Each agent has a budget constraint on the total size of …

The topic of fair allocation of indivisible items has been receiving significant attention
because of its applicability in real-world settings, such as budgeted course allocations, room …

For the assignment problem where multiple indivisible items are allocated to a group of
agents given their ordinal preferences, we design randomized mechanisms that satisfy first …