Externalities in Chore Division
The chore division problem simulates the fair division of a heterogeneous, undesirable resource among several agents. In the fair division of chores, each agent only gets the disutility from its own piece. Agents may, however, also be concerned with the pieces given to other agents; these externalities naturally appear in fair division situations. We first demonstrate the generalization of the classical concepts of proportionality and envy-freeness while extending the classical model by taking externalities into account.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sequential Online Chore Division for Autonomous Vehicle Convoy Formation
Chore division is a class of fair division problems in which some undesirable "resource" must be shared among a set of participants, with each participant wanting to get as little as possible. Typically the set of partic…
Chore division on a graph
The paper considers fair allocation of indivisible nondisposable items that generate disutility (chores). We assume that these items are placed in the vertices of a graph and each agent's share has to form a connected su…
Accurate chromosome segregation by probabilistic self-organization
Background: For faithful chromosome segregation during cell division, correct attachments must be established between sister chromosomes and microtubules from opposite spindle poles through kinetochores (chromosome bi-or…
Rental Harmony: Sperner's Lemma in Fair Division
We wish to explain a powerful approach to fair-division questions that unifies these problems and provides new methods for achieving approximate envy-free divisions, in which each person feels she received the “best” sha…
LEMMATemporal Fair Division of Indivisible Items
We study a fair division model where indivisible items arrive sequentially, and must be allocated immediately and irrevocably. Previous work on online fair division has shown impossibility results in achieving approximat…