10 citations · 14 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.AI2018
Chore division on a graph
Sylvain Bouveret, Katarína Cechlárová, Julien Lesca
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…
cs.AI2018
Efficiency, Sequenceability and Deal-Optimality in Fair Division of Indivisible Goods
Aurélie Beynier, Sylvain Bouveret, Michel Lemaître +2
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a…