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 fair division of a set of indivisible goods among $ n $ agents with additive
valuations using the fairness notion of maximin share (MMS). MMS is the most popular …

We study the fair allocation of mixtures of indivisible goods and chores under lexicographic
preferences $\unicode {x2014} $ a subdomain of additive preferences. A prominent fairness …

We initiate the study of fairness among classes of agents in online bipartite matching where
there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that …

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-free …

We study the problem of fairly allocating a set of m indivisible chores (items with non-positive
value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin share …

We study the maximin share (MMS) fair allocation of $ m $ indivisible tasks to $ n $ agents
who have costs for completing the assigned tasks. It is known that exact MMS fairness …

Fairness is one of the most desirable societal principles in collective decision-making. It has
been extensively studied in the past decades for its axiomatic properties and has received …

We consider the problem of fair division, where a set of indivisible goods should be
distributed fairly among a set of agents with combinatorial valuations. To capture fairness …

The widespread adoption of Artificial Intelligence (AI) systems has profoundly reshaped
decisionmaking in social, political, and commercial contexts. This paper explores the critical …