Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …

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 …

Allocating resources to individuals in a fair manner has been a topic of interest since the
ancient times, with most of the early rigorous mathematical work on the problem focusing on …

The theory of algorithmic fair allocation is at the center of multi-agent systems and
economics in recent decades due to its industrial and social importance. At a high level, the …

We consider the classic problem of fairly allocating indivisible goods among agents with
additive valuation functions and explore the connection between two prominent fairness …

The fair division of indivisible goods is a very well-studied problem. The goal of this problem
is to distribute m goods to n agents in a “fair” manner, where every agent has a valuation for …

We study the problem of fair allocation of m indivisible items among n agents with additive
valuations using the popular notion of maximin share (MMS) as our measure of fairness. An …

Influence maximization is a widely used model for information dissemination in social
networks. Recent work has employed such interventions across a wide range of social …

We study the fundamental problem of fairly allocating a set of indivisible goods among n
agents with additive valuations using the desirable fairness notion of maximin share (MMS) …

We consider the problem of fairly allocating indivisible goods, among agents, under
cardinality constraints and additive valuations. In this setting, we are given a partition of the …