activity
20112026
most citedWeighted Envy-Freeness in Indivisible Item Allocation

58 citations · 867 across the 88 of their papers we have counts for

collaborators
Showing 2021Show all

11 papers · 1 filter

cs.GT2021★ 3 cited

The Price of Justified Representation

Edith Elkind, Piotr Faliszewski, Ayumi Igarashi +3

In multiwinner approval voting, the goal is to select -member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the just…

cs.GT2021★ 6 cited

Truthful Cake Sharing

Xiaohui Bei, Xinhang Lu, Warut Suksompong

The classic cake cutting problem concerns the fair allocation of a heterogeneous resource among interested agents. In this paper, we study a public goods variant of the problem, wh…

cs.GT2021★ 8 cited

Weighted Fairness Notions for Indivisible Items Revisited

Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong

We revisit the setting of fairly allocating indivisible items when agents have different weights representing their entitlements. First, we propose a parameterized family of relaxa…

cs.GT2021

Fairness Concepts for Indivisible Items with Externalities

Haris Aziz, Warut Suksompong, Zhaohong Sun +1

We study a fair allocation problem of indivisible items under additive externalities in which each agent also receives values from items that are assigned to other agents. We propo…

cs.GT2021★ 2 cited

Justifying Groups in Multiwinner Approval Voting

Edith Elkind, Piotr Faliszewski, Ayumi Igarashi +3

Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown thr…

cs.GT2021★ 6 cited

On the Complexity of Fair House Allocation

Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong

We study fairness in house allocation, where houses are to be allocated among agents so that every agent receives one house. We show that maximizing the number of envy-free…

cs.GT2021

Graphical Cake Cutting via Maximin Share

Edith Elkind, Erel Segal-Halevi, Warut Suksompong

We study the recently introduced cake-cutting setting in which the cake is represented by an undirected graph. This generalizes the canonical interval cake and allows for modeling…

cs.GT2021★ 4 cited

Keep Your Distance: Land Division With Separation

Edith Elkind, Erel Segal-Halevi, Warut Suksompong

This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements…

cs.GT2021★ 8 cited

Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory

Pasin Manurangsi, Warut Suksompong

We study the allocation of indivisible goods among groups of agents using well-known fairness notions such as envy-freeness and proportionality. While these notions cannot always b…

math.CO2021★ 5 cited

Generalized Kings and Single-Elimination Winners in Random Tournaments

Pasin Manurangsi, Warut Suksompong

Tournaments can be used to model a variety of practical scenarios including sports competitions and elections. A natural notion of strength of alternatives in a tournament is a gen…

cs.GT2021★ 27 cited

Picking Sequences and Monotonicity in Weighted Fair Division

Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong

We study the problem of fairly allocating indivisible items to agents with different entitlements, which captures, for example, the distribution of ministries among political parti…