We study a portioning setting in which a public resource such as time or...
Charity is typically done either by individual donors, who donate money ...
We study the problem of fairly allocating a divisible resource in the fo...
We study the problem of fairly allocating indivisible goods to agents wi...
Maximum bipartite matching is a fundamental algorithmic problem which ca...
Cake cutting is a classic fair division problem, with the cake serving a...
In the allocation of indivisible goods, the maximum Nash welfare rule ha...
In the allocation of indivisible goods, the maximum Nash welfare (MNW) r...
Fairness and privacy are two important concerns in social decision-makin...
We consider a voting scenario in which the resource to be voted upon may...
We introduce a class of strategic games in which agents are assigned to ...
We investigate the fair allocation of indivisible goods to agents with
p...
We study a fair division setting in which a number of players are to be
...
Social decision schemes (SDSs) map the preferences of individual voters ...
Knockout tournaments constitute a popular format for organizing sports
c...
We consider the problem of fairly allocating indivisible goods to agents...
In multiwinner approval voting, the goal is to select k-member committee...
The classic cake cutting problem concerns the fair allocation of a
heter...
We revisit the setting of fairly allocating indivisible items when agent...
We study a fair allocation problem of indivisible items under additive
e...
Justified representation (JR) is a standard notion of representation in
...
We study fairness in house allocation, where m houses are to be allocate...
This paper is part of an ongoing endeavor to bring the theory of fair
di...
We study the recently introduced cake-cutting setting in which the cake ...
We study the allocation of indivisible goods among groups of agents usin...
Tournaments can be used to model a variety of practical scenarios includ...
We study the problem of fairly allocating indivisible items to agents wi...
We study the problem of fairly allocating a divisible resource, also kno...
Tournament solutions are standard tools for identifying winners based on...
Schelling's model is an influential model that reveals how individual
pe...
Consensus halving refers to the problem of dividing a resource into two ...
Envy-freeness is a standard benchmark of fairness in resource allocation...
We study a mechanism design problem where a community of agents wishes t...
We study a resource allocation setting where m discrete items are to be
...
A fundamental property of choice functions is stability, which, loosely
...
A fundamental result in cake cutting states that for any number of playe...
Tournament solutions are frequently used to select winners from a set of...
We study the fair allocation of a cake, which serves as a metaphor for a...
We consider the classical cake-cutting problem where we wish to fairly d...
In this paper, we introduce and analyze new envy-based fairness concepts...
We study the fair allocation of indivisible goods under the assumption t...
We investigate the efficiency of fair allocations of indivisible goods u...
We consider the house allocation problem, where m houses are to be assig...
We consider strategic games that are inspired by Schelling's model of
re...
We study the problem of fairly allocating indivisible goods between grou...
We consider a fair division setting in which m indivisible items are to ...
We investigate the query complexity of the fair allocation of indivisibl...
Fair division has long been an important problem in the economics litera...
We study the problem of fairly dividing a heterogeneous resource, common...
This paper investigates a variant of the work-stealing algorithm that we...