38 citations · 38 across the 4 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2024
Cutsets and EF1 Fair Division of Graphs
Jiehua Chen, William S. Zwicker
In fair division of a connected graph , each of agents receives a share of 's vertex set . These shares partition , with each share required to induce a co…
cs.GT2018★ 38 cited
Almost Envy-Free Allocations with Connected Bundles
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini +5
We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an und…
cs.GT2016
Cycles and Intractability in a Large Class of Aggregation Rules
William S. Zwicker
We introduce the -Kemeny rule -- a generalization of Kemeny's voting rule that aggregates -chotomous weak orders into a -chotomous weak order. Special cases of …