Search Results for author: Warut Suksompong

Found 9 papers, 2 papers with code

Cutting a Cake Fairly for Groups Revisited

no code implementations22 Jan 2023 Erel Segal-haLevi, Warut Suksompong

Cake cutting is a classic fair division problem, with the cake serving as a metaphor for a heterogeneous divisible resource.

Extending the Characterization of Maximum Nash Welfare

no code implementations10 Jan 2023 Sheung Man Yuen, Warut Suksompong

In the allocation of indivisible goods, the maximum Nash welfare rule has recently been characterized as the only rule within the class of additive welfarist rules that satisfies envy-freeness up to one good.

A Characterization of Maximum Nash Welfare for Indivisible Goods

no code implementations8 Dec 2022 Warut Suksompong

In the allocation of indivisible goods, the maximum Nash welfare (MNW) rule, which chooses an allocation maximizing the product of the agents' utilities, has received substantial attention for its fairness.


On Maximum Weighted Nash Welfare for Binary Valuations

no code implementations8 Apr 2022 Warut Suksompong, Nicholas Teh

We consider the problem of fairly allocating indivisible goods to agents with weights representing their entitlements.

Margin of Victory in Tournaments: Structural and Experimental Results

1 code implementation4 Dec 2020 Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong

Tournament solutions are standard tools for identifying winners based on pairwise comparisons between competing alternatives.

Computer Science and Game Theory

Welfare Guarantees in Schelling Segregation

no code implementations3 Dec 2020 Martin Bullinger, Warut Suksompong, Alexandros A. Voudouris

Schelling's model is an influential model that reveals how individual perceptions and incentives can lead to residential segregation.

Computer Science and Game Theory

Weighted Envy-Freeness in Indivisible Item Allocation

no code implementations23 Sep 2019 Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick

We introduce and analyze new envy-based fairness concepts for agents with weights that quantify their entitlements in the allocation of indivisible items.


Fairly Allocating Many Goods with Few Queries

no code implementations30 Jul 2018 Hoon Oh, Ariel D. Procaccia, Warut Suksompong

For two agents with arbitrary monotonic utilities, we design an algorithm that computes an allocation satisfying envy-freeness up to one good (EF1), a relaxation of envy-freeness, using a logarithmic number of queries.

Democratic Fair Allocation of Indivisible Goods

2 code implementations8 Sep 2017 Erel Segal-haLevi, Warut Suksompong

We introduce the concept of democratic fairness, which aims to satisfy a certain fraction of the agents in each group.

Computer Science and Game Theory

Cannot find the paper you are looking for? You can Submit a new open access paper.