Warut Suksompong

research

∙ 07/28/2023

Settling the Score: Portioning with Cardinal Preferences

We study a portioning setting in which a public resource such as time or...

0 Edith Elkind, et al. ∙

research

∙ 05/17/2023

Balanced Donor Coordination

Charity is typically done either by individual donors, who donate money ...

0 Felix Brandt, et al. ∙

research

∙ 04/23/2023

Approximate Envy-Freeness in Graphical Cake Cutting

We study the problem of fairly allocating a divisible resource in the fo...

0 Sheung Man Yuen, et al. ∙

research

∙ 03/25/2023

Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness

We study the problem of fairly allocating indivisible goods to agents wi...

0 Warut Suksompong, et al. ∙

research

∙ 03/04/2023

On Maximum Bipartite Matching with Separation

Maximum bipartite matching is a fundamental algorithmic problem which ca...

0 Pasin Manurangsi, et al. ∙

research

∙ 01/22/2023

Cutting a Cake Fairly for Groups Revisited

Cake cutting is a classic fair division problem, with the cake serving a...

0 Erel Segal-Halevi, et al. ∙

research

∙ 01/10/2023

Extending the Characterization of Maximum Nash Welfare

In the allocation of indivisible goods, the maximum Nash welfare rule ha...

0 Sheung Man Yuen, et al. ∙

research

∙ 12/08/2022

A Characterization of Maximum Nash Welfare for Indivisible Goods

In the allocation of indivisible goods, the maximum Nash welfare (MNW) r...

0 Warut Suksompong, et al. ∙

research

∙ 11/23/2022

Differentially Private Fair Division

Fairness and privacy are two important concerns in social decision-makin...

0 Pasin Manurangsi, et al. ∙

research

∙ 11/23/2022

Approval-Based Voting with Mixed Goods

We consider a voting scenario in which the resource to be voted upon may...

0 Xinhang Lu, et al. ∙

research

∙ 11/20/2022

Topological Distance Games

We introduce a class of strategic games in which agents are assigned to ...

0 Martin Bullinger, et al. ∙

research

∙ 09/14/2022

Weighted Envy-Freeness for Submodular Valuations

We investigate the fair allocation of indivisible goods to agents with p...

0 Luisa Montanari, et al. ∙

research

∙ 06/13/2022

Fair Division with Two-Sided Preferences

We study a fair division setting in which a number of players are to be ...

0 Ayumi Igarashi, et al. ∙

research

∙ 04/26/2022

Incentives in Social Decision Schemes with Pairwise Comparison Preferences

Social decision schemes (SDSs) map the preferences of individual voters ...

0 Felix Brandt, et al. ∙

research

∙ 04/24/2022

Fixing Knockout Tournaments With Seeds

Knockout tournaments constitute a popular format for organizing sports c...

0 Pasin Manurangsi, et al. ∙

research

∙ 04/08/2022

On Maximum Weighted Nash Welfare for Binary Valuations

We consider the problem of fairly allocating indivisible goods to agents...

0 Warut Suksompong, et al. ∙

research

∙ 12/11/2021

The Price of Justified Representation

In multiwinner approval voting, the goal is to select k-member committee...

0 Edith Elkind, et al. ∙

research

∙ 12/10/2021

Truthful Cake Sharing

The classic cake cutting problem concerns the fair allocation of a heter...

0 Xiaohui Bei, et al. ∙

research

∙ 12/08/2021

Weighted Fairness Notions for Indivisible Items Revisited

We revisit the setting of fairly allocating indivisible items when agent...

0 Mithun Chakraborty, et al. ∙

research

∙ 10/18/2021

Fairness Concepts for Indivisible Items with Externalities

We study a fair allocation problem of indivisible items under additive e...

0 Haris Aziz, et al. ∙

research

∙ 08/30/2021

Justifying Groups in Multiwinner Approval Voting

Justified representation (JR) is a standard notion of representation in ...

0 Edith Elkind, et al. ∙

research

∙ 06/13/2021

On the Complexity of Fair House Allocation

We study fairness in house allocation, where m houses are to be allocate...

0 Naoyuki Kamiyama, et al. ∙

research

∙ 05/14/2021

Keep Your Distance: Land Division With Separation

This paper is part of an ongoing endeavor to bring the theory of fair di...

0 Edith Elkind, et al. ∙

research

∙ 05/11/2021

Graphical Cake Cutting via Maximin Share

We study the recently introduced cake-cutting setting in which the cake ...

0 Edith Elkind, et al. ∙

research

∙ 05/04/2021

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

We study the allocation of indivisible goods among groups of agents usin...

0 Pasin Manurangsi, et al. ∙

research

∙ 05/01/2021

Generalized Kings and Single-Elimination Winners in Random Tournaments

Tournaments can be used to model a variety of practical scenarios includ...

0 Pasin Manurangsi, et al. ∙

research

∙ 04/29/2021

Picking Sequences and Monotonicity in Weighted Fair Division

We study the problem of fairly allocating indivisible items to agents wi...

0 Mithun Chakraborty, et al. ∙

research

∙ 12/12/2020

Mind the Gap: Cake Cutting With Separation

We study the problem of fairly allocating a divisible resource, also kno...

0 Edith Elkind, et al. ∙

research

∙ 12/04/2020

Margin of Victory in Tournaments: Structural and Experimental Results

Tournament solutions are standard tools for identifying winners based on...

0 Markus Brill, et al. ∙

research

∙ 12/03/2020

Welfare Guarantees in Schelling Segregation

Schelling's model is an influential model that reveals how individual pe...

0 Martin Bullinger, et al. ∙

research

∙ 07/14/2020

Consensus Halving for Sets of Items

Consensus halving refers to the problem of dividing a resource into two ...

0 Paul W. Goldberg, et al. ∙

research

∙ 05/30/2020

On the Number of Almost Envy-Free Allocations

Envy-freeness is a standard benchmark of fairness in resource allocation...

0 Warut Suksompong, et al. ∙

research

∙ 05/16/2020

Funding Public Projects: A Case for the Nash Product Rule

We study a mechanism design problem where a community of agents wishes t...

0 Florian Brandl, et al. ∙

research

∙ 04/12/2020

Closing Gaps in Asymptotic Fair Division

We study a resource allocation setting where m discrete items are to be ...

0 Pasin Manurangsi, et al. ∙

research

∙ 04/03/2020

On the Structure of Stable Tournament Solutions

A fundamental property of choice functions is stability, which, loosely ...

0 Felix Brandt, et al. ∙

research

∙ 01/10/2020

How to Cut a Cake Fairly: A Generalization to Groups

A fundamental result in cake cutting states that for any number of playe...

0 Erel Segal-Halevi, et al. ∙

research

∙ 11/14/2019

Refining Tournament Solutions via Margin of Victory

Tournament solutions are frequently used to select winners from a set of...

0 Markus Brill, et al. ∙

research

∙ 11/13/2019

Contiguous Cake Cutting: Hardness Results and Approximation Algorithms

We study the fair allocation of a cake, which serves as a metaphor for a...

0 Paul W. Goldberg, et al. ∙

research

∙ 10/30/2019

Dividing a Graphical Cake

We consider the classical cake-cutting problem where we wish to fairly d...

0 Xiaohui Bei, et al. ∙

research

∙ 09/23/2019

On Weighted Envy-Freeness in Indivisible Item Allocation

In this paper, we introduce and analyze new envy-based fairness concepts...

0 Mithun Chakraborty, et al. ∙

research

∙ 08/15/2019

Connected Fair Allocation of Indivisible Goods

We study the fair allocation of indivisible goods under the assumption t...

0 Xiaohui Bei, et al. ∙

research

∙ 05/13/2019

The Price of Fairness for Indivisible Goods

We investigate the efficiency of fair allocations of indivisible goods u...

0 Xiaohui Bei, et al. ∙

research

∙ 05/01/2019

Envy-Freeness in House Allocation Problems

We consider the house allocation problem, where m houses are to be assig...

0 Jiarui Gan, et al. ∙

research

∙ 02/21/2019

Schelling Games on Graphs

We consider strategic games that are inspired by Schelling's model of re...

0 Edith Elkind, et al. ∙

research

∙ 01/24/2019

Almost Envy-Freeness in Group Resource Allocation

We study the problem of fairly allocating indivisible goods between grou...

0 Maria Kyropoulou, et al. ∙

research

∙ 11/05/2018

When Do Envy-Free Allocations Exist?

We consider a fair division setting in which m indivisible items are to ...

0 Pasin Manurangsi, et al. ∙

research

∙ 07/30/2018

Fairly Allocating Many Goods with Few Queries

We investigate the query complexity of the fair allocation of indivisibl...

0 Hoon Oh, et al. ∙

research

∙ 06/01/2018

Asymptotic Existence of Proportionally Fair Allocations

Fair division has long been an important problem in the economics litera...

0 Warut Suksompong, et al. ∙

research

∙ 04/18/2018

Truthful Fair Division without Free Disposal

We study the problem of fairly dividing a heterogeneous resource, common...

0 Xiaohui Bei, et al. ∙

research

∙ 04/13/2018

On the Efficiency of Localized Work Stealing

This paper investigates a variant of the work-stealing algorithm that we...

0 Warut Suksompong, et al. ∙

Warut Suksompong

Featured Co-authors