Warut Suksompong

Warut Suksompong is an Assistant Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). He holds the prestigious NUS Presidential Young Professorship and specializes in algorithmic game theory, computational social choice, and mechanism design, with applications to fair resource allocation problems.

Dr. Suksompong completed his Ph.D. in Computer Science at Stanford University in 2018 under the supervision of Tim Roughgarden. Prior to joining NUS, he was a postdoctoral researcher at the University of Oxford hosted by Edith Elkind. His educational background includes an M.S. in Computer Science from Stanford (2016), an M.Eng. in Electrical Engineering and Computer Science from MIT (2014), and a B.S. in Computer Science and Engineering from MIT (2013).

His research focuses on fair division problems with practical constraints such as connectivity requirements (e.g., allocating contiguous office spaces) and separation requirements (e.g., social distancing in resource allocation). He has made significant contributions to understanding how these real-world constraints affect traditional fairness concepts like envy-freeness and proportionality. His work bridges theoretical computer science with practical applications in economics, operations research, and social choice theory.

Dr. Suksompong's publications demonstrate a consistent focus on developing algorithms and theoretical frameworks for fair resource allocation under various constraints. His work spans multiple venues including AAAI, IJCAI, and leading journals in computer science and economics. The publications show increasing sophistication in handling complex constraints and developing robust fairness guarantees.

• IJCAI 2021 Distinguished Paper Award
• WINE 2021 Best Student Paper Award
• NUS Presidential Young Professorship

As an educator, Dr. Suksompong teaches courses including CS3230 Design and Analysis of Algorithms, CS4261 Algorithmic Mechanism Design, and CS5461 Algorithmic Mechanism Design. His research has been recognized with teaching excellence awards at NUS. He has presented tutorials at major conferences including IJCAI 2019, 2022, and 2024, helping to disseminate knowledge in computational social choice and fair division.

His work has practical implications for numerous real-world scenarios including office space allocation, fair cake cutting with separation constraints (relevant to post-pandemic resource allocation), and tournament design. His research group at NUS focuses on developing algorithmic solutions for fair resource allocation problems with connectivity constraints and computational methods for tournament selection.