activity
20162024
most citedAlmost Envy-Free Allocations with Connected Bundles

38 citations · 38 across the 4 of their papers we have counts for

collaborators

6 papers

cs.LG2024

Social Choice Should Guide AI Alignment in Dealing with Diverse Human Feedback

Vincent Conitzer, Rachel Freedman, Jobst Heitzig +9

Foundation models such as GPT-4 are fine-tuned to avoid unsafe or otherwise problematic behavior, such as helping to commit crimes or producing racist text. One approach to fine-tu…

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…

math.CO2023

Nash's bargaining problem and the scale-invariant Hirsch citation index

Josep Freixas, Roger Hoerl, William S. Zwicker

A number of citation indices have been proposed for measuring and ranking the research publication records of scholars. Some of the best known indices, such as those proposed by Hi…

math.CO2021

Fair division of graphs and of tangled cakes

Ayumi Igarashi, William S. Zwicker

A tangle is a connected topological space constructed by gluing several copies of the unit interval . We explore which tangles guarantee envy-free allocations of connected…

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 …