# Warut Suksompong

According to our database

Collaborative distances:

^{1}, Warut Suksompong authored at least 40 papers between 2014 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Pricing Multi-Unit Markets.

ACM Trans. Economics and Comput., 2020

Robust bounds on choosing from large tournaments.

Social Choice and Welfare, 2020

On the Number of Almost Envy-Free Allocations.

CoRR, 2020

Funding Public Projects: A Case for the Nash Product Rule.

CoRR, 2020

Closing Gaps in Asymptotic Fair Division.

CoRR, 2020

On the Structure of Stable Tournament Solutions.

CoRR, 2020

How to Cut a Cake Fairly: A Generalization to Groups.

CoRR, 2020

Weighted Envy-Freeness in Indivisible Item Allocation.

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Refining Tournament Solutions via Margin of Victory.

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Simple Pricing Schemes for the Cloud.

ACM Trans. Economics and Comput., 2019

On Black-Box Transformations in Downward-Closed Environments.

Theory Comput. Syst., 2019

Envy-freeness in house allocation problems.

Math. Soc. Sci., 2019

Fairly allocating contiguous blocks of indivisible items.

Discret. Appl. Math., 2019

Dividing a Graphical Cake.

CoRR, 2019

On Weighted Envy-Freeness in Indivisible Item Allocation.

CoRR, 2019

Connected Fair Allocation of Indivisible Goods.

CoRR, 2019

Democratic fair allocation of indivisible goods.

Artif. Intell., 2019

Computing a small agreeable set of indivisible items.

Artif. Intell., 2019

Almost Envy-Freeness in Group Resource Allocation.

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Schelling Games on Graphs.

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

The Price of Fairness for Indivisible Goods.

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Fairly Allocating Many Goods with Few Queries.

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

When Do Envy-Free Allocations Exist?

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Approximate maximin shares for groups of agents.

Math. Soc. Sci., 2018

Truthful Fair Division without Free Disposal.

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Who Can Win a Single-Elimination Tournament?

SIAM J. Discret. Math., 2017

Asymptotic existence of fair divisions for groups.

Math. Soc. Sci., 2017

On Democratic Fairness for Groups of Agents.

CoRR, 2017

Pricing Identical Items.

CoRR, 2017

Computing an Approximately Optimal Agreeable Set of Items.

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

Scheduling asynchronous round-robin tournaments.

Oper. Res. Lett., 2016

Upper Bounds on Number of Steals in Rooted Trees.

Theory Comput. Syst., 2016

Asymptotic existence of proportionally fair allocations.

Math. Soc. Sci., 2016

On the efficiency of localized work stealing.

Inf. Process. Lett., 2016

An ordinal minimax theorem.

Games Econ. Behav., 2016

Assigning a Small Agreeable Set of Indivisible Items to Multiple Players.

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Individual and group stability in neutral restrictions of hedonic games.

Math. Soc. Sci., 2015

The Impossibility of Extending Random Dictatorship to Weak Preferences.

CoRR, 2015

2014

On a Subposet of the Tamari Lattice.

Order, 2014