引用次数
引用: 1,531
H-指数: 23
I10-指数 : 49
出版物: 161
On a Subposet of the Tamari Lattice
Warut Suksompong , Rik Sengupta , Sebastian A. Csar
Discrete Mathematics & Theoretical Computer Science ( 01) 563 -574
1
2012
Bounds on Multithreaded Computations by Work Stealing
Warut Suksompong
Massachusetts Institute of Technology
4
2014
Upper Bounds on Number of Steals in Rooted Trees
Warut Suksompong , Tao Benjamin Schardl , Charles E. Leiserson
Springer US
2015
Pricing Identical Items.
Warut Suksompong , Tim Roughgarden , Michal Feldman , Tomer Ezra
arXiv: Computer Science and Game Theory
3
2017
Approximate Maximin Shares for Groups of Agents
Warut Suksompong
arXiv: Computer Science and Game Theory
5
2017
On Black-Box Transformations in Downward-Closed Environments
Warut Suksompong , Warut Suksompong
arXiv: Computer Science and Game Theory
2017
On Black-Box Transformations in Downward-Closed Environments
Warut Suksompong , Warut Suksompong
arXiv: Computer Science and Game Theory
2017
On Democratic Fairness for Groups of Agents.
Warut Suksompong , Erel Segal-Halevi
2
2017
Fairly Allocating Many Goods with Few Queries
Warut Suksompong , Ariel D. Procaccia , Hoon Oh
arXiv: Computer Science and Game Theory
2
2018
When Do Envy-Free Allocations Exist?
Warut Suksompong , Pasin Manurangsi
arXiv: Computer Science and Game Theory
3
2018
On the efficiency of localized work stealing
Warut Suksompong , Tao Benjamin Schardl , Charles E Leiserson
Other univ. web domain
2015
Schelling Games on Graphs
Warut Suksompong , Edith Elkind , Alexandros A. Voudouris , Ayumi Igarashi
arXiv: Computer Science and Game Theory
5
2019
The Price of Fairness for Indivisible Goods
Warut Suksompong , Pasin Manurangsi , Xiaohui Bei , Xinhang Lu
arXiv: Computer Science and Game Theory
1
2019
Upper Bounds on Number of Steals in Rooted Trees
Warut Suksompong , Tao B. Schardl , Charles E. Leiserson
arXiv: Distributed, Parallel, and Cluster Computing
2017
Who can win a single-elimination tournament?
Warut Suksompong , Virginia Vassilevska Williams , Michael P. Kim
national conference on artificial intelligence 516 -522
3
2016
Connected Fair Allocation of Indivisible Goods
Warut Suksompong , Xiaohui Bei , Ayumi Igarashi , Xinhang Lu
arXiv: Computer Science and Game Theory
5
2019
Weighted Envy-Freeness in Indivisible Item Allocation.
Warut Suksompong , Ayumi Igarashi , Yair Zick , Mithun Chakraborty
arXiv: Artificial Intelligence
2019
Dividing a Graphical Cake.
Warut Suksompong , Xiaohui Bei
arXiv: Computer Science and Game Theory
7
2019
Refining Tournament Solutions via Margin of Victory
Warut Suksompong , Markus Brill , Ulrike Schmidt-Kraepelin
arXiv: Computer Science and Game Theory
2019
The Price of Connectivity in Fair Division.
Warut Suksompong , Xiaohui Bei , Ayumi Igarashi , Xinhang Lu
arXiv: Computer Science and Game Theory
8
2019
Pasin Manurangsi Ayumi Igarashi Erel Segal-haLevi Xiaohui Bei Edith Elkind Felix Brandt Ulrike Schmidt-Kraepelin Alexandros A. Voudouris Markus Brill Mithun Chakraborty Jiarui Gan Nicholas Teh Florian Brandl Matthias Greger Alexandros Hollender Dominik Peters Christian Stricker Ariel Procaccia Martin Bullinger