Warut Suksompong
NUS Presidential Young ProfessorSchool of Computing, National University of Singapore
Email: warut at comp.nus.edu.sg
[CV]
I am an assistant professor in the School of Computing at the National University of Singapore. Previously, I was a postdoctoral researcher in computer science at the University of Oxford, hosted by Edith Elkind. I completed my PhD at Stanford University, where my advisor was Tim Roughgarden, and received my bachelor's and master's degrees from the Massachusetts Institute of Technology. My research interests include algorithmic game theory, computational social choice, mechanism design, and other problems at the interface between computer science, economics, mathematics, and operations research.
News: I will be presenting a tutorial "Tournaments in Computational Social Choice" at IJCAI 2024. Please feel free to join!
Surveys
Constraints in Fair DivisionWarut Suksompong
ACM SIGecom Exchanges, Vol. 19, No. 2, November 2021, pp. 46-61.
[PDF]
Tournaments in Computational Social Choice: Recent Developments
Warut Suksompong
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), August 2021, pp. 4611-4618.
[PDF]
Publications
Welfare Loss in Connected Resource AllocationXiaohui Bei, Alexander Lam, Xinhang Lu, and Warut Suksompong
In Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI), August 2024, Forthcoming.
[Conference]
Ordinal Maximin Guarantees for Group Fair Division
Pasin Manurangsi and Warut Suksompong
In Proceedings of the 33rd International Joint Conference on Artificial Intelligence (IJCAI), August 2024, Forthcoming.
[Conference] [PDF]
Envy-Free House Allocation with Minimum Subsidy
Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, and Jian Zhang
Operations Research Letters, Vol. 54, May 2024, Article 107103.
[Journal] [PDF]
Approval-Based Voting with Mixed Goods
Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, and Warut Suksompong
Social Choice and Welfare, Forthcoming.
A preliminary version appeared in Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), February 2023, pp. 5781-5788.
[Journal] [Conference] [PDF]
Truthful Cake Sharing
Xiaohui Bei, Xinhang Lu, and Warut Suksompong
Social Choice and Welfare, Forthcoming. Special issue on Fair Public Decision Making: Allocating Budgets, Seats, and Probability.
A preliminary version appeared in Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), February-March 2022, pp. 4809-4817.
[Journal] [Conference] [PDF]
Reachability of Fair Allocations via Sequential Exchanges
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, and Sheung Man Yuen
In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI), February 2024, pp. 9773-9780.
[Conference] [PDF]
Weighted Envy-Freeness for Submodular Valuations
Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, and Nicholas Teh
In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI), February 2024, pp. 9865-9873.
[Conference] [PDF]
Fast & Fair: A Collaborative Platform for Fair Division Applications
Jiatong Han and Warut Suksompong
In Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI), Demonstration Track, February 2024, pp. 23796-23798.
[Conference] [PDF] [Website]
Topological Distance Games
Martin Bullinger and Warut Suksompong
Theoretical Computer Science, Vol. 981, January 2024, Article 114238.
A preliminary version appeared in Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), February 2023, pp. 5549-5556.
[Journal] [Conference] [PDF]
Incentives in Social Decision Schemes with Pairwise Comparison Preferences
Felix Brandt, Patrick Lederer, and Warut Suksompong
Games and Economic Behavior, Vol. 142, November 2023, pp. 266-291.
A preliminary version appeared in Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), July 2022, pp. 130-136.
[Journal] [Conference] [PDF]
Fixing Knockout Tournaments With Seeds
Pasin Manurangsi and Warut Suksompong
Discrete Applied Mathematics, Vol. 339, November 2023, pp. 21-35.
A preliminary version appeared in Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), July 2022, pp. 412-418.
[Journal] [Conference] [PDF]
Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness
Warut Suksompong and Nicholas Teh
Mathematical Social Sciences, Vol. 126, November 2023, pp. 48-59.
An abstract appeared in Proceedings of the 16th International Symposium on Algorithmic Game Theory (SAGT), September 2023, pp. XXIII-XXIV. The paper was accepted to the conference as a full paper.
[Journal] [Conference] [PDF]
Settling the Score: Portioning with Cardinal Preferences
Edith Elkind, Warut Suksompong, and Nicholas Teh
In Proceedings of the 26th European Conference on Artificial Intelligence (ECAI), September-October 2023, pp. 621-628.
[Conference] [PDF]
Fair Division with Two-Sided Preferences
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, and Hanna Sumita
In Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI), August 2023, pp. 2756-2764.
[Conference] [PDF]
Approximate Envy-Freeness in Graphical Cake Cutting
Sheung Man Yuen and Warut Suksompong
In Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI), August 2023, pp. 2923-2930.
[Conference] [PDF]
Justifying Groups in Multiwinner Approval Voting
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, and Warut Suksompong
Theoretical Computer Science, Vol. 969, August 2023, Article 114039. Special issue for SAGT 2022.
A preliminary version appeared in Proceedings of the 15th International Symposium on Algorithmic Game Theory (SAGT), September 2022, pp. 472-489.
[Journal] [Conference] [PDF]
Keep Your Distance: Land Division With Separation
Edith Elkind, Erel Segal-Halevi, and Warut Suksompong
Computational Geometry, Vol. 113, August 2023, Article 102006.
A preliminary version appeared in Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), August 2021, pp. 168-174.
[Journal] [Conference] [PDF] [News] [Blog]
IJCAI '21 Distinguished Paper Award
On Maximum Bipartite Matching with Separation
Pasin Manurangsi, Erel Segal-Halevi, and Warut Suksompong
Information Processing Letters, Vol. 182, August 2023, Article 106388.
[Journal] [PDF]
Balanced Donor Coordination
Felix Brandt, Matthias Greger, Erel Segal-Halevi, and Warut Suksompong
In Proceedings of the 24th ACM Conference on Economics and Computation (EC), July 2023, p. 299.
The paper was accepted to the conference as a full paper but published as an abstract.
[Conference] [PDF]
Cutting a Cake Fairly for Groups Revisited
Erel Segal-Halevi and Warut Suksompong
American Mathematical Monthly, Vol. 130, No. 3, March 2023, pp. 203-213.
[Journal] [PDF]
Extending the Characterization of Maximum Nash Welfare
Sheung Man Yuen and Warut Suksompong
Economics Letters, Vol. 224, March 2023, Article 111030.
[Journal] [PDF]
Fairness Concepts for Indivisible Items with Externalities
Haris Aziz, Warut Suksompong, Zhaohong Sun, and Toby Walsh
In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), February 2023, pp. 5472-5480.
[Conference] [PDF]
Differentially Private Fair Division
Pasin Manurangsi and Warut Suksompong
In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), February 2023, pp. 5814-5822.
[Conference] [PDF]
A Characterization of Maximum Nash Welfare for Indivisible Goods
Warut Suksompong
Economics Letters, Vol. 222, January 2023, Article 110956.
[Journal] [PDF]
Mind the Gap: Cake Cutting With Separation
Edith Elkind, Erel Segal-Halevi, and Warut Suksompong
Artificial Intelligence, Vol. 313, December 2022, Article 103783.
A preliminary version appeared in Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), February 2021, pp. 5330-5338.
[Journal] [Conference] [PDF]
Consensus Halving for Sets of Items
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, and Warut Suksompong
Mathematics of Operations Research, Vol. 47, No. 4, November 2022, pp. 3357-3379.
A preliminary version appeared in Proceedings of the 16th Conference on Web and Internet Economics (WINE), December 2020, pp. 384-397.
[Journal] [Conference] [PDF]
Generalized Kings and Single-Elimination Winners in Random Tournaments
Pasin Manurangsi and Warut Suksompong
Autonomous Agents and Multi-Agent Systems, Vol. 36, No. 2, October 2022, Article 28.
A preliminary version appeared in Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), August 2021, pp. 328-334.
[Journal] [Conference] [PDF]
Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory
Pasin Manurangsi and Warut Suksompong
Theoretical Computer Science, Vol. 930, September 2022, pp. 179-195.
A preliminary version appeared in Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), August 2021, pp. 335-341.
[Journal] [Conference] [PDF]
The Price of Connectivity in Fair Division
Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, and Warut Suksompong
SIAM Journal on Discrete Mathematics, Vol. 36, No. 2, 2022, pp. 1156-1186.
A preliminary version appeared in Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), February 2021, pp. 5151-5158.
[Journal] [Conference] [PDF]
On Maximum Weighted Nash Welfare for Binary Valuations
Warut Suksompong and Nicholas Teh
Mathematical Social Sciences, Vol. 117, May 2022, pp. 101-108.
[Journal] [PDF]
Funding Public Projects: A Case for the Nash Product Rule
Florian Brandl, Felix Brandt, Matthias Greger, Dominik Peters, Christian Stricker, and Warut Suksompong
Journal of Mathematical Economics, Vol. 99, March 2022, Article 102585.
An abstract appeared in Proceedings of the 17th Conference on Web and Internet Economics (WINE), December 2021, p. 548. The paper was accepted to the conference as a full paper. A preliminary version titled "Donor Coordination: Collective Distribution of Individual Contributions" was presented at the 1st Games, Agents, and Incentives Workshop (GAIW), May 2019.
[Journal] [Conference] [Workshop] [PDF] [News]
WINE '21 Best Student Paper Award
Weighted Fairness Notions for Indivisible Items Revisited
Mithun Chakraborty, Erel Segal-Halevi, and Warut Suksompong
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), February-March 2022, pp. 4949-4956.
[Conference] [PDF]
The Price of Justified Representation
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, and Warut Suksompong
In Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI), February-March 2022, pp. 4983-4990.
[Conference] [PDF] [Code]
Margin of Victory for Tournament Solutions
Markus Brill, Ulrike Schmidt-Kraepelin, and Warut Suksompong
Artificial Intelligence, Vol. 302, January 2022, Article 103600.
Full version of the AAAI '20 and AAAI '21 papers.
[Journal] [PDF]
Schelling Games on Graphs
Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, and Alexandros A. Voudouris
Artificial Intelligence, Vol. 301, December 2021, Article 103576.
This paper combines the IJCAI '19 paper with the AAAI '20 paper "Swap Stability in Schelling Games on Graphs" by Agarwal, Elkind, Gan, and Voudouris.
[Journal] [PDF]
Picking Sequences and Monotonicity in Weighted Fair Division
Mithun Chakraborty, Ulrike Schmidt-Kraepelin, and Warut Suksompong
Artificial Intelligence, Vol. 301, December 2021, Article 103578.
Preliminary versions appeared in Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), August 2021, pp. 82-88, and Proceedings of the 3rd Games, Agents, and Incentives Workshop (GAIW), May 2021.
[Journal] [Conference] [Workshop] [PDF]
The Price of Fairness for Indivisible Goods
Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, and Warut Suksompong
Theory of Computing Systems, Vol. 65, No. 7, October 2021, pp. 1069-1093.
A preliminary version appeared in Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), August 2019, pp. 81-87.
[Journal] [Conference] [PDF]
Weighted Envy-Freeness in Indivisible Item Allocation
Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, and Yair Zick
ACM Transactions on Economics and Computation, Vol. 9, No. 3, September 2021, Article 18.
Preliminary versions appeared in Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), May 2020, pp. 231-239, and Proceedings of the 2nd Games, Agents, and Incentives Workshop (GAIW), May 2020.
[Journal] [Conference] [Workshop] [PDF] [Blog]
Graphical Cake Cutting via Maximin Share
Edith Elkind, Erel Segal-Halevi, and Warut Suksompong
In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI), August 2021, pp. 161-167.
[Conference] [PDF]
Welfare Guarantees in Schelling Segregation
Martin Bullinger, Warut Suksompong, and Alexandros A. Voudouris
Journal of Artificial Intelligence Research, Vol. 71, 2021, pp. 143-174.
A preliminary version appeared in Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), February 2021, pp. 5236-5243.
[Journal] [Conference] [PDF]
On the Complexity of Fair House Allocation
Naoyuki Kamiyama, Pasin Manurangsi, and Warut Suksompong
Operations Research Letters, Vol. 49, No. 4, July 2021, pp. 572-577.
[Journal] [PDF]
Closing Gaps in Asymptotic Fair Division
Pasin Manurangsi and Warut Suksompong
SIAM Journal on Discrete Mathematics, Vol. 35, No. 2, 2021, pp. 668-706.
[Journal] [PDF]
Fairly Allocating Many Goods with Few Queries
Hoon Oh, Ariel D. Procaccia, and Warut Suksompong
SIAM Journal on Discrete Mathematics, Vol. 35, No. 2, 2021, pp. 788-813.
A preliminary version appeared in Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), January-February 2019, pp. 2141-2148. The paper was also presented at the 6th Day on Computational Game Theory (DCGT), February 2019.
[Journal] [Conference] [PDF]
Dividing a Graphical Cake
Xiaohui Bei and Warut Suksompong
In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), February 2021, pp. 5159-5166.
[Conference] [PDF]
Margin of Victory in Tournaments: Structural and Experimental Results
Markus Brill, Ulrike Schmidt-Kraepelin, and Warut Suksompong
In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI), February 2021, pp. 5228-5235.
The full version, combined with the AAAI '20 paper, appeared in Artificial Intelligence.
[Conference] [PDF] [Code]
How to Cut a Cake Fairly: A Generalization to Groups
Erel Segal-Halevi and Warut Suksompong
American Mathematical Monthly, Vol. 128, No. 1, January 2021, pp. 79-83.
[Journal] [PDF]
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
Paul W. Goldberg, Alexandros Hollender, and Warut Suksompong
Journal of Artificial Intelligence Research, Vol. 69, 2020, pp. 109-141.
A preliminary version appeared in Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI), February 2020, pp. 1990-1997.
[Journal] [Conference] [PDF]
Almost Envy-Freeness in Group Resource Allocation
Maria Kyropoulou, Warut Suksompong, and Alexandros A. Voudouris
Theoretical Computer Science, Vol. 841, November 2020, pp. 110-123.
A preliminary version appeared in Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), August 2019, pp. 400-406.
[Journal] [Conference] [PDF]
Truthful Fair Division Without Free Disposal
Xiaohui Bei, Guangda Huzhang, and Warut Suksompong
Social Choice and Welfare, Vol. 55, No. 3, October 2020, pp. 523-545.
A preliminary version appeared in Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), July 2018, pp. 63-69.
[Journal] [Conference] [PDF]
When Do Envy-Free Allocations Exist?
Pasin Manurangsi and Warut Suksompong
SIAM Journal on Discrete Mathematics, Vol. 34, No. 3, 2020, pp. 1505-1521.
A preliminary version appeared in Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI), January-February 2019, pp. 2109-2116.
[Journal] [Conference] [PDF]
On the Number of Almost Envy-Free Allocations
Warut Suksompong
Discrete Applied Mathematics, Vol. 284, September 2020, pp. 606-610.
[Journal] [PDF]
Refining Tournament Solutions via Margin of Victory
Markus Brill, Ulrike Schmidt-Kraepelin, and Warut Suksompong
In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI), February 2020, pp. 1862-1869.
The full version, combined with the AAAI '21 paper, appeared in Artificial Intelligence.
[Conference] [PDF]
Pricing Multi-Unit Markets
Tomer Ezra, Michal Feldman, Tim Roughgarden, and Warut Suksompong
ACM Transactions on Economics and Computation, Vol. 7, No. 4, February 2020, Article 20.
A preliminary version appeared in Proceedings of the 14th Conference on Web and Internet Economics (WINE), December 2018, pp. 140-153.
[Journal] [Conference] [PDF]
Robust Bounds on Choosing from Large Tournaments
Christian Saile and Warut Suksompong
Social Choice and Welfare, Vol. 54, No. 1, January 2020, pp. 87-110.
Preliminary versions appeared in Proceedings of the 14th Conference on Web and Internet Economics (WINE), December 2018, pp. 393-407, and Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC), June 2018.
[Journal] [Conference] [Workshop] [PDF]
Democratic Fair Allocation of Indivisible Goods
Erel Segal-Halevi and Warut Suksompong
Artificial Intelligence, Vol. 277, December 2019, Article 103167.
Preliminary versions appeared in Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), July 2018, pp. 482-488, and Proceedings of the 7th International Workshop on Computational Social Choice (COMSOC), June 2018.
[Journal] [Conference] [Workshop] [PDF] [Code]
Envy-Freeness in House Allocation Problems
Jiarui Gan, Warut Suksompong, and Alexandros A. Voudouris
Mathematical Social Sciences, Vol. 101, September 2019, pp. 104-106.
[Journal] [PDF]
Schelling Games on Graphs
Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, and Alexandros A. Voudouris
In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI), August 2019, pp. 266-272.
The full version, combined with the AAAI '20 paper "Swap Stability in Schelling Games on Graphs" by Agarwal, Elkind, Gan, and Voudouris, appeared in Artificial Intelligence.
[Conference] [PDF]
On Black-Box Transformations in Downward-Closed Environments
Warut Suksompong
Theory of Computing Systems, Vol. 63, No. 6, August 2019, pp. 1207-1227.
An abstract appeared in Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT), September 2017, p. XV. The paper was accepted to the conference as a full paper.
[Journal] [Conference] [PDF]
Simple Pricing Schemes for the Cloud
Ian A. Kash, Peter Key, and Warut Suksompong
ACM Transactions on Economics and Computation, Vol. 7, No. 2, August 2019, Article 7.
Preliminary versions appeared in Proceedings of the 13th Conference on Web and Internet Economics (WINE), December 2017, pp. 311-324, and Proceedings of the 12th Workshop on the Economics of Networks, Systems and Computation (NetEcon), June 2017.
[Journal] [Conference] [Workshop] [PDF]
Fairly Allocating Contiguous Blocks of Indivisible Items
Warut Suksompong
Discrete Applied Mathematics, Vol. 260, May 2019, pp. 227-236.
A preliminary version appeared in Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT), September 2017, pp. 333-344.
[Journal] [Conference] [PDF]
Computing a Small Agreeable Set of Indivisible Items
Pasin Manurangsi and Warut Suksompong
Artificial Intelligence, Vol. 268, March 2019, pp. 96-114.
Full version of the IJCAI '16 and IJCAI '17 papers.
[Journal] [PDF]
On the Structure of Stable Tournament Solutions
Felix Brandt, Markus Brill, Hans Georg Seedig, and Warut Suksompong
Economic Theory, Vol. 65, No. 2, March 2018, pp. 483-507.
[Journal] [PDF]
Approximate Maximin Shares for Groups of Agents
Warut Suksompong
Mathematical Social Sciences, Vol. 92, March 2018, pp. 40-47.
An abstract appeared in Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT), September 2017, p. XIV. The paper was accepted to the conference as a full paper.
[Journal] [Conference] [PDF]
Who Can Win a Single-Elimination Tournament?
Michael P. Kim, Warut Suksompong, and Virginia Vassilevska Williams
SIAM Journal on Discrete Mathematics, Vol. 31, No. 3, 2017, pp. 1751-1764.
Preliminary versions appeared in Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI), February 2016, pp. 516-522, and Proceedings of the 6th International Workshop on Computational Social Choice (COMSOC), June 2016.
[Journal] [Conference] [Workshop] [PDF]
Asymptotic Existence of Fair Divisions for Groups
Pasin Manurangsi and Warut Suksompong
Mathematical Social Sciences, Vol. 89, September 2017, pp. 100-108.
An abstract appeared in Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT), September 2017, pp. XII-XIII. The paper was accepted to the conference as a full paper.
[Journal] [Conference] [PDF]
Computing an Approximately Optimal Agreeable Set of Items
Pasin Manurangsi and Warut Suksompong
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), August 2017, pp. 338-344.
The full version, combined with the IJCAI '16 paper, appeared in Artificial Intelligence.
[Conference] [PDF]
Assigning a Small Agreeable Set of Indivisible Items to Multiple Players
Warut Suksompong
In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI), July 2016, pp. 489-495.
The full version, combined with the IJCAI '17 paper, appeared in Artificial Intelligence.
[Conference] [PDF]
Asymptotic Existence of Proportionally Fair Allocations
Warut Suksompong
Mathematical Social Sciences, Vol. 81, May 2016, pp. 62-65.
[Journal] [PDF]
The Impossibility of Extending Random Dictatorship to Weak Preferences
Florian Brandl, Felix Brandt, and Warut Suksompong
Economics Letters, Vol. 141, April 2016, pp. 44-47.
[Journal] [PDF] [Corrigendum]
On the Efficiency of Localized Work Stealing
Warut Suksompong, Charles E. Leiserson, and Tao B. Schardl
Information Processing Letters, Vol. 116, No. 2, February 2016, pp. 100-106.
[Journal] [PDF]
Upper Bounds on Number of Steals in Rooted Trees
Charles E. Leiserson, Tao B. Schardl, and Warut Suksompong
Theory of Computing Systems, Vol. 58, No. 2, February 2016, pp. 223-240.
[Journal] [PDF]
An Ordinal Minimax Theorem
Felix Brandt, Markus Brill, and Warut Suksompong
Games and Economic Behavior, Vol. 95, January 2016, pp. 107-112.
Also presented at the 5th World Congress of the Game Theory Society (GAMES), July 2016.
[Journal] [PDF]
Scheduling Asynchronous Round-Robin Tournaments
Warut Suksompong
Operations Research Letters, Vol. 44, No. 1, January 2016, pp. 96-100.
[Journal] [PDF]
Individual and Group Stability in Neutral Restrictions of Hedonic Games
Warut Suksompong
Mathematical Social Sciences, Vol. 78, November 2015, pp. 1-5.
[Journal] [PDF]
On a Subposet of the Tamari Lattice
Sebastian A. Csar, Rik Sengupta, and Warut Suksompong
Order, Vol. 31, No. 3, November 2014, pp. 337-363.
A preliminary version appeared in Proceedings of the 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC), July-August 2012, pp. 567-578.
[Journal] [Conference] [PDF]
Theses
Resource Allocation and Decision Making for GroupsWarut Suksompong
PhD Thesis, Stanford University, August 2018.
[Thesis] [PDF]
Bounds on Multithreaded Computations by Work Stealing
Warut Suksompong
Master's Thesis, Massachusetts Institute of Technology, June 2014.
[Thesis] [PDF]
Tutorials
Tournaments in Computational Social ChoiceWarut Suksompong
Presented at the 33rd International Joint Conference on Artificial Intelligence (IJCAI), August 2024.
Constraints in Fair Division
Ayumi Igarashi and Warut Suksompong
Presented at the 31st International Joint Conference on Artificial Intelligence (IJCAI), July 2022.
[Tutorial]
Fair Division of Indivisible Items: Asymptotics and Graph-Theoretic Approaches
Ayumi Igarashi and Warut Suksompong
Presented at the 28th International Joint Conference on Artificial Intelligence (IJCAI), August 2019.
[Tutorial]
Editorials
Guest Editorial: Special Issue on Fair DivisionEdith Elkind, Nicolas Maudet, and Warut Suksompong
Autonomous Agents and Multi-Agent Systems, Vol. 36, No. 2, October 2022, Article 33.
[Editorial] [Special issue]
Miscellaneous
Graph Cycles and Olympiad ProblemsWarut Suksompong
Mathematics Magazine, Vol. 93, No. 4, October 2020, pp. 284-287.
[Journal] [PDF]
Some problems I have proposed
Warut Suksompong
[PDF]