58 citations · 867 across the 88 of their papers we have counts for
9 papers · 1 filter
Refining Tournament Solutions via Margin of Victory
Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong
Tournament solutions are frequently used to select winners from a set of alternatives based on pairwise comparisons between alternatives. Prior work has shown that several common t…
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
Paul W. Goldberg, Alexandros Hollender, Warut Suksompong
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under the requirement that each agent should receive a contiguous piece of the cake. Wh…
Dividing a Graphical Cake
Xiaohui Bei, Warut Suksompong
We consider the classical cake-cutting problem where we wish to fairly divide a heterogeneous resource, often modeled as a cake, among interested agents. Work on the subject typica…
Weighted Envy-Freeness in Indivisible Item Allocation
Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong +1
We introduce and analyze new envy-based fairness concepts for agents with weights that quantify their entitlements in the allocation of indivisible items. We propose two variants o…
The Price of Connectivity in Fair Division
Xiaohui Bei, Ayumi Igarashi, Xinhang Lu +1
We study the allocation of indivisible goods that form an undirected graph and quantify the loss of fairness when we impose a constraint that each agent must receive a connected su…
The Price of Fairness for Indivisible Goods
Xiaohui Bei, Xinhang Lu, Pasin Manurangsi +1
We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions suc…
Envy-Freeness in House Allocation Problems
Jiarui Gan, Warut Suksompong, Alexandros A. Voudouris
We consider the house allocation problem, where houses are to be assigned to agents so that each agent gets exactly one house. We present a polynomial-time algorithm that d…
Schelling Games on Graphs
Edith Elkind, Jiarui Gan, Ayumi Igarashi +2
We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on…
Almost Envy-Freeness in Group Resource Allocation
Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris
We study the problem of fairly allocating indivisible goods between groups of agents using the recently introduced relaxations of envy-freeness. We consider the existence of fair a…