This thesis theoretically studies fairness, efficiency, and strategyproofness, in the model of assigning a set of indivisible items to multiple agents. Fairness, with an interpretation of social justice, ensures that everyone is treated unbiasedly. Efficiency, a quantitative indicator, measures the utilization of the total resource. Strategyproofness, a desired property of the assignment protocol, inhibits the strategic behavior of misreporting information from participants. This work, first in Chapter 3, focuses on the allocation of chores (items with non-positive value) and studies two envy-based and two share-based fairness criteria. The analysis provides the connections between fairness criteria and also investigates, in the worst-case ...
We investigate the efficiency of fair allocations of indivisible goods using the well-studied price ...
I study the age old problem of fair and efficient resource allocation. While many fairness notions e...
We study the computational complexity of computing allocations that are both fair and maximize the u...
We study several fairness notions in allocating indivisible chores (i.e., items with non-positive va...
We study the problem of fairly allocating a multiset $M$ of $m$ indivisible items among $n$ agents w...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We study fair allocations of indivisible goods and chores in conjunction with system efficiency, mea...
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We study a fair allocation problem of indivisible items under additive externalities in which each a...
How should one allocate scarce resources among a group of people in a satisfactory manner when the p...
Fair division problems have been vastly studied in the past 60 years. This line of research was init...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...
National audienceIn fair division of indivisible goods, using sequences of sincere choices (or picki...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
We investigate the efficiency of fair allocations of indivisible goods using the well-studied price ...
I study the age old problem of fair and efficient resource allocation. While many fairness notions e...
We study the computational complexity of computing allocations that are both fair and maximize the u...
We study several fairness notions in allocating indivisible chores (i.e., items with non-positive va...
We study the problem of fairly allocating a multiset $M$ of $m$ indivisible items among $n$ agents w...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We study fair allocations of indivisible goods and chores in conjunction with system efficiency, mea...
We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents...
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion ...
We study a fair allocation problem of indivisible items under additive externalities in which each a...
How should one allocate scarce resources among a group of people in a satisfactory manner when the p...
Fair division problems have been vastly studied in the past 60 years. This line of research was init...
Resource allocation aims at allocating scarce resources to strategic agents in an efficient and fair...
National audienceIn fair division of indivisible goods, using sequences of sincere choices (or picki...
This paper considers the problem of allocating N indivisible objects among N agents according to the...
We investigate the efficiency of fair allocations of indivisible goods using the well-studied price ...
I study the age old problem of fair and efficient resource allocation. While many fairness notions e...
We study the computational complexity of computing allocations that are both fair and maximize the u...