default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWarut Suksompong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j57]Warut Suksompong:
Weighted fair division of indivisible items: A review. Inf. Process. Lett. 187: 106519 (2025)- 2024
- [j56]Sheung Man Yuen, Warut Suksompong:
Approximate envy-freeness in graphical cake cutting. Discret. Appl. Math. 357: 112-131 (2024) - [j55]Ayumi Igarashi
, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair division with two-sided preferences. Games Econ. Behav. 147: 268-287 (2024) - [j54]Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-free house allocation with minimum subsidy. Oper. Res. Lett. 54: 107103 (2024) - [j53]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 643-677 (2024) - [j52]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Correction: Approval-based voting with mixed goods. Soc. Choice Welf. 62(4): 679 (2024) - [j51]Martin Bullinger, Warut Suksompong:
Topological distance games. Theor. Comput. Sci. 981: 114238 (2024) - [j50]Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong:
Weighted Fairness Notions for Indivisible Items Revisited. ACM Trans. Economics and Comput. 12(3): 9:1-9:45 (2024) - [j49]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. ACM Trans. Economics and Comput. 12(3): 11:1-11:27 (2024) - [c52]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. AAAI 2024: 9773-9780 - [c51]Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, Nicholas Teh:
Weighted Envy-Freeness for Submodular Valuations. AAAI 2024: 9865-9873 - [c50]Jiatong Han, Warut Suksompong:
Fast & Fair: A Collaborative Platform for Fair Division Applications. AAAI 2024: 23796-23798 - [c49]Xiaohui Bei, Alexander Lam, Xinhang Lu, Warut Suksompong:
Welfare Loss in Connected Resource Allocation. IJCAI 2024: 2660-2668 - [c48]Pasin Manurangsi, Warut Suksompong:
Ordinal Maximin Guarantees for Group Fair Division. IJCAI 2024: 2922-2930 - [c47]Warut Suksompong:
Expanding the Reach of Social Choice Theory. IJCAI 2024: 8571-8576 - [c46]Zihan Li, Pasin Manurangsi, Jonathan Scarlett, Warut Suksompong:
Complexity of Round-Robin Allocation with Potentially Noisy Queries. SAGT 2024: 520-537 - [i72]Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong:
Optimal Budget Aggregation with Single-Peaked Preferences. CoRR abs/2402.15904 (2024) - [i71]Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-Free House Allocation with Minimum Subsidy. CoRR abs/2403.01162 (2024) - [i70]Pasin Manurangsi, Warut Suksompong:
Ordinal Maximin Guarantees for Group Fair Division. CoRR abs/2404.11543 (2024) - [i69]Zihan Li, Pasin Manurangsi, Jonathan Scarlett, Warut Suksompong:
Complexity of Round-Robin Allocation with Potentially Noisy Queries. CoRR abs/2404.19402 (2024) - [i68]Xiaohui Bei, Alexander Lam, Xinhang Lu, Warut Suksompong:
Welfare Loss in Connected Resource Allocation. CoRR abs/2405.03467 (2024) - 2023
- [j48]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Keep your distance: Land division with separation. Comput. Geom. 113: 102006 (2023) - [j47]Pasin Manurangsi, Warut Suksompong:
Fixing knockout tournaments with seeds. Discret. Appl. Math. 339: 21-35 (2023) - [j46]Felix Brandt, Patrick Lederer, Warut Suksompong:
Incentives in social decision schemes with pairwise comparison preferences. Games Econ. Behav. 142: 266-291 (2023) - [j45]Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong:
On maximum bipartite matching with separation. Inf. Process. Lett. 182: 106388 (2023) - [j44]Warut Suksompong, Nicholas Teh:
Weighted fair division with matroid-rank valuations: Monotonicity and strategyproofness. Math. Soc. Sci. 126: 48-59 (2023) - [j43]Erel Segal-Halevi, Warut Suksompong:
Cutting a Cake Fairly for Groups Revisited. Am. Math. Mon. 130(3): 203-213 (2023) - [j42]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying groups in multiwinner approval voting. Theor. Comput. Sci. 969: 114039 (2023) - [c45]Haris Aziz, Warut Suksompong, Zhaohong Sun, Toby Walsh:
Fairness Concepts for Indivisible Items with Externalities. AAAI 2023: 5472-5480 - [c44]Martin Bullinger, Warut Suksompong:
Topological Distance Games. AAAI 2023: 5549-5556 - [c43]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. AAAI 2023: 5781-5788 - [c42]Pasin Manurangsi, Warut Suksompong:
Differentially Private Fair Division. AAAI 2023: 5814-5822 - [c41]Edith Elkind, Warut Suksompong, Nicholas Teh:
Settling the Score: Portioning with Cardinal Preferences. ECAI 2023: 621-628 - [c40]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. IJCAI 2023: 2756-2764 - [c39]Sheung Man Yuen, Warut Suksompong:
Approximate Envy-Freeness in Graphical Cake Cutting. IJCAI 2023: 2923-2930 - [c38]Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong:
Balanced Donor Coordination. EC 2023: 299 - [i67]Sheung Man Yuen, Warut Suksompong:
Extending the Characterization of Maximum Nash Welfare. CoRR abs/2301.03798 (2023) - [i66]Erel Segal-Halevi, Warut Suksompong:
Cutting a Cake Fairly for Groups Revisited. CoRR abs/2301.09061 (2023) - [i65]Pasin Manurangsi, Erel Segal-Halevi, Warut Suksompong:
On Maximum Bipartite Matching with Separation. CoRR abs/2303.02283 (2023) - [i64]Warut Suksompong, Nicholas Teh:
Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness. CoRR abs/2303.14454 (2023) - [i63]Sheung Man Yuen, Warut Suksompong:
Approximate Envy-Freeness in Graphical Cake Cutting. CoRR abs/2304.11659 (2023) - [i62]Felix Brandt, Matthias Greger, Erel Segal-Halevi, Warut Suksompong:
Balanced Donor Coordination. CoRR abs/2305.10286 (2023) - [i61]Edith Elkind, Warut Suksompong, Nicholas Teh:
Settling the Score: Portioning with Cardinal Preferences. CoRR abs/2307.15586 (2023) - [i60]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. CoRR abs/2312.07241 (2023) - 2022
- [j41]Pasin Manurangsi, Warut Suksompong:
Generalized kings and single-elimination winners in random tournaments. Auton. Agents Multi Agent Syst. 36(1): 28 (2022) - [j40]Edith Elkind, Nicolas Maudet, Warut Suksompong:
Guest editorial: special issue on fair division. Auton. Agents Multi Agent Syst. 36(2): 33 (2022) - [j39]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of victory for tournament solutions. Artif. Intell. 302: 103600 (2022) - [j38]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the gap: Cake cutting with separation. Artif. Intell. 313: 103783 (2022) - [j37]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. Math. Oper. Res. 47(4): 3357-3379 (2022) - [j36]Warut Suksompong, Nicholas Teh:
On maximum weighted Nash welfare for binary valuations. Math. Soc. Sci. 117: 101-108 (2022) - [j35]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. SIAM J. Discret. Math. 36(2): 1156-1186 (2022) - [j34]Pasin Manurangsi, Warut Suksompong:
Almost envy-freeness for groups: Improved bounds via discrepancy theory. Theor. Comput. Sci. 930: 179-195 (2022) - [c37]Xiaohui Bei, Xinhang Lu, Warut Suksompong:
Truthful Cake Sharing. AAAI 2022: 4809-4817 - [c36]Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong:
Weighted Fairness Notions for Indivisible Items Revisited. AAAI 2022: 4949-4956 - [c35]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c34]Felix Brandt, Patrick Lederer, Warut Suksompong:
Incentives in Social Decision Schemes with Pairwise Comparison Preferences. IJCAI 2022: 130-136 - [c33]Pasin Manurangsi, Warut Suksompong:
Fixing Knockout Tournaments With Seeds. IJCAI 2022: 412-418 - [c32]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - [i59]Warut Suksompong, Nicholas Teh:
On Maximum Weighted Nash Welfare for Binary Valuations. CoRR abs/2204.03803 (2022) - [i58]Pasin Manurangsi, Warut Suksompong:
Fixing Knockout Tournaments With Seeds. CoRR abs/2204.11171 (2022) - [i57]Felix Brandt, Patrick Lederer, Warut Suksompong:
Incentives in Social Decision Schemes with Pairwise Comparison Preferences. CoRR abs/2204.12436 (2022) - [i56]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. CoRR abs/2206.05879 (2022) - [i55]Luisa Montanari, Ulrike Schmidt-Kraepelin, Warut Suksompong, Nicholas Teh:
Weighted Envy-Freeness for Submodular Valuations. CoRR abs/2209.06437 (2022) - [i54]Martin Bullinger, Warut Suksompong:
Topological Distance Games. CoRR abs/2211.11000 (2022) - [i53]Xinhang Lu, Jannik Peters, Haris Aziz, Xiaohui Bei, Warut Suksompong:
Approval-Based Voting with Mixed Goods. CoRR abs/2211.12647 (2022) - [i52]Pasin Manurangsi, Warut Suksompong:
Differentially Private Fair Division. CoRR abs/2211.12738 (2022) - [i51]Warut Suksompong:
A Characterization of Maximum Nash Welfare for Indivisible Goods. CoRR abs/2212.04203 (2022) - 2021
- [j33]Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling games on graphs. Artif. Intell. 301: 103576 (2021) - [j32]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking sequences and monotonicity in weighted fair division. Artif. Intell. 301: 103578 (2021) - [j31]Martin Bullinger, Warut Suksompong, Alexandros A. Voudouris:
Welfare Guarantees in Schelling Segregation. J. Artif. Intell. Res. 71: 143-174 (2021) - [j30]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. Theory Comput. Syst. 65(7): 1069-1093 (2021) - [j29]Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong:
On the complexity of fair house allocation. Oper. Res. Lett. 49(4): 572-577 (2021) - [j28]Pasin Manurangsi, Warut Suksompong:
Closing Gaps in Asymptotic Fair Division. SIAM J. Discret. Math. 35(2): 668-706 (2021) - [j27]Hoon Oh, Ariel D. Procaccia, Warut Suksompong:
Fairly Allocating Many Goods with Few Queries. SIAM J. Discret. Math. 35(2): 788-813 (2021) - [j26]Warut Suksompong:
Constraints in fair division. SIGecom Exch. 19(2): 46-61 (2021) - [j25]Erel Segal-Halevi, Warut Suksompong:
How to Cut a Cake Fairly: A Generalization to Groups. Am. Math. Mon. 128(1): 79-83 (2021) - [j24]Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick:
Weighted Envy-freeness in Indivisible Item Allocation. ACM Trans. Economics and Comput. 9(3): 18:1-18:39 (2021) - [c31]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. AAAI 2021: 5151-5158 - [c30]Xiaohui Bei, Warut Suksompong:
Dividing a Graphical Cake. AAAI 2021: 5159-5166 - [c29]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of Victory in Tournaments: Structural and Experimental Results. AAAI 2021: 5228-5235 - [c28]Martin Bullinger, Warut Suksompong, Alexandros A. Voudouris:
Welfare Guarantees in Schelling Segregation. AAAI 2021: 5236-5243 - [c27]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the Gap: Cake Cutting With Separation. AAAI 2021: 5330-5338 - [c26]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking Sequences and Monotonicity in Weighted Fair Division. IJCAI 2021: 82-88 - [c25]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Graphical Cake Cutting via Maximin Share. IJCAI 2021: 161-167 - [c24]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Keep Your Distance: Land Division With Separation. IJCAI 2021: 168-174 - [c23]Pasin Manurangsi, Warut Suksompong:
Generalized Kings and Single-Elimination Winners in Random Tournaments. IJCAI 2021: 328-334 - [c22]Pasin Manurangsi, Warut Suksompong:
Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory. IJCAI 2021: 335-341 - [c21]Warut Suksompong:
Tournaments in Computational Social Choice: Recent Developments. IJCAI 2021: 4611-4618 - [c20]Florian Brandl, Felix Brandt, Matthias Greger, Dominik Peters, Christian Stricker, Warut Suksompong:
Funding Public Projects: A Case for the Nash Product Rule. WINE 2021: 548 - [i50]Mithun Chakraborty, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Picking Sequences and Monotonicity in Weighted Fair Division. CoRR abs/2104.14347 (2021) - [i49]Pasin Manurangsi, Warut Suksompong:
Generalized Kings and Single-Elimination Winners in Random Tournaments. CoRR abs/2105.00193 (2021) - [i48]Pasin Manurangsi, Warut Suksompong:
Almost Envy-Freeness for Groups: Improved Bounds via Discrepancy Theory. CoRR abs/2105.01609 (2021) - [i47]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Graphical Cake Cutting via Maximin Share. CoRR abs/2105.04755 (2021) - [i46]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Keep Your Distance: Land Division With Separation. CoRR abs/2105.06669 (2021) - [i45]Naoyuki Kamiyama, Pasin Manurangsi, Warut Suksompong:
On the Complexity of Fair House Allocation. CoRR abs/2106.06925 (2021) - [i44]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. CoRR abs/2108.12949 (2021) - [i43]Haris Aziz, Warut Suksompong, Zhaohong Sun, Toby Walsh:
Fairness Concepts for Indivisible Items with Externalities. CoRR abs/2110.09066 (2021) - [i42]Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong:
Weighted Fairness Notions for Indivisible Items Revisited. CoRR abs/2112.04166 (2021) - [i41]Xiaohui Bei, Xinhang Lu, Warut Suksompong:
Truthful Cake Sharing. CoRR abs/2112.05632 (2021) - [i40]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. CoRR abs/2112.05994 (2021) - 2020
- [j23]Warut Suksompong:
On the number of almost envy-free allocations. Discret. Appl. Math. 284: 606-610 (2020) - [j22]Paul W. Goldberg, Alexandros Hollender, Warut Suksompong:
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. J. Artif. Intell. Res. 69: 109-141 (2020) - [j21]Christian Saile, Warut Suksompong:
Robust bounds on choosing from large tournaments. Soc. Choice Welf. 54(1): 87-110 (2020) - [j20]Xiaohui Bei, Guangda Huzhang, Warut Suksompong:
Truthful fair division without free disposal. Soc. Choice Welf. 55(3): 523-545 (2020) - [j19]Pasin Manurangsi, Warut Suksompong:
When Do Envy-Free Allocations Exist? SIAM J. Discret. Math. 34(3): 1505-1521 (2020) - [j18]Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris:
Almost envy-freeness in group resource allocation. Theor. Comput. Sci. 841: 110-123 (2020) - [j17]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Multi-Unit Markets. ACM Trans. Economics and Comput. 7(4): 20:1-20:29 (2020) - [c19]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Refining Tournament Solutions via Margin of Victory. AAAI 2020: 1862-1869 - [c18]Paul W. Goldberg, Alexandros Hollender, Warut Suksompong:
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. AAAI 2020: 1990-1997 - [c17]Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick:
Weighted Envy-Freeness in Indivisible Item Allocation. AAMAS 2020: 231-239 - [c16]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. WINE 2020: 384-397 - [i39]Erel Segal-Halevi, Warut Suksompong:
How to Cut a Cake Fairly: A Generalization to Groups. CoRR abs/2001.03327 (2020) - [i38]Felix Brandt, Markus Brill, Hans Georg Seedig, Warut Suksompong:
On the Structure of Stable Tournament Solutions. CoRR abs/2004.01651 (2020) - [i37]Pasin Manurangsi, Warut Suksompong:
Closing Gaps in Asymptotic Fair Division. CoRR abs/2004.05563 (2020) - [i36]Florian Brandl, Felix Brandt, Dominik Peters, Christian Stricker, Warut Suksompong:
Funding Public Projects: A Case for the Nash Product Rule. CoRR abs/2005.07997 (2020) - [i35]Warut Suksompong:
On the Number of Almost Envy-Free Allocations. CoRR abs/2006.00178 (2020) - [i34]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. CoRR abs/2007.06754 (2020) - [i33]Martin Bullinger, Warut Suksompong, Alexandros A. Voudouris:
Welfare Guarantees in Schelling Segregation. CoRR abs/2012.02086 (2020) - [i32]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Margin of Victory in Tournaments: Structural and Experimental Results. CoRR abs/2012.02657 (2020) - [i31]Edith Elkind, Erel Segal-Halevi, Warut Suksompong:
Mind the Gap: Cake Cutting With Separation. CoRR abs/2012.06682 (2020)
2010 – 2019
- 2019
- [j16]Pasin Manurangsi, Warut Suksompong:
Computing a small agreeable set of indivisible items. Artif. Intell. 268: 96-114 (2019) - [j15]Erel Segal-Halevi, Warut Suksompong:
Democratic fair allocation of indivisible goods. Artif. Intell. 277 (2019) - [j14]Warut Suksompong:
Fairly allocating contiguous blocks of indivisible items. Discret. Appl. Math. 260: 227-236 (2019) - [j13]Jiarui Gan, Warut Suksompong, Alexandros A. Voudouris:
Envy-freeness in house allocation problems. Math. Soc. Sci. 101: 104-106 (2019) - [j12]Warut Suksompong:
On Black-Box Transformations in Downward-Closed Environments. Theory Comput. Syst. 63(6): 1207-1227 (2019) - [j11]Ian A. Kash, Peter B. Key, Warut Suksompong:
Simple Pricing Schemes for the Cloud. ACM Trans. Economics and Comput. 7(2): 7:1-7:27 (2019) - [c15]Pasin Manurangsi, Warut Suksompong:
When Do Envy-Free Allocations Exist? AAAI 2019: 2109-2116 - [c14]Hoon Oh, Ariel D. Procaccia, Warut Suksompong:
Fairly Allocating Many Goods with Few Queries. AAAI 2019: 2141-2148 - [c13]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. IJCAI 2019: 81-87 - [c12]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. IJCAI 2019: 266-272 - [c11]Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris:
Almost Envy-Freeness in Group Resource Allocation. IJCAI 2019: 400-406 - [i30]Maria Kyropoulou, Warut Suksompong, Alexandros A. Voudouris:
Almost Envy-Freeness in Group Resource Allocation. CoRR abs/1901.08463 (2019) - [i29]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. CoRR abs/1902.07937 (2019) - [i28]Jiarui Gan, Warut Suksompong, Alexandros A. Voudouris:
Envy-Freeness in House Allocation Problems. CoRR abs/1905.00468 (2019) - [i27]Xiaohui Bei, Xinhang Lu, Pasin Manurangsi, Warut Suksompong:
The Price of Fairness for Indivisible Goods. CoRR abs/1905.04910 (2019) - [i26]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
Connected Fair Allocation of Indivisible Goods. CoRR abs/1908.05433 (2019) - [i25]Mithun Chakraborty, Warut Suksompong, Yair Zick:
On Weighted Envy-Freeness in Indivisible Item Allocation. CoRR abs/1909.10502 (2019) - [i24]Xiaohui Bei, Warut Suksompong:
Dividing a Graphical Cake. CoRR abs/1910.14129 (2019) - [i23]Paul W. Goldberg, Alexandros Hollender, Warut Suksompong:
Contiguous Cake Cutting: Hardness Results and Approximation Algorithms. CoRR abs/1911.05416 (2019) - [i22]Markus Brill, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Refining Tournament Solutions via Margin of Victory. CoRR abs/1911.06289 (2019) - 2018
- [b1]Warut Suksompong:
Resource allocation and decision making for groups. Stanford University, USA, 2018 - [j10]Warut Suksompong:
Approximate maximin shares for groups of agents. Math. Soc. Sci. 92: 40-47 (2018) - [c10]Xiaohui Bei, Guangda Huzhang, Warut Suksompong:
Truthful Fair Division without Free Disposal. IJCAI 2018: 63-69 - [c9]Erel Segal-Halevi, Warut Suksompong:
Democratic Fair Allocation of Indivisible Goods. IJCAI 2018: 482-488 - [c8]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Multi-unit Markets. WINE 2018: 140-153 - [c7]Christian Saile, Warut Suksompong:
Robust Bounds on Choosing from Large Tournaments. WINE 2018: 393-407 - [i21]Christian Saile, Warut Suksompong:
Robust Bounds on Choosing from Large Tournaments. CoRR abs/1804.02743 (2018) - [i20]Warut Suksompong:
Individual and Group Stability in Neutral Restrictions of Hedonic Games. CoRR abs/1804.03315 (2018) - [i19]Warut Suksompong:
Scheduling Asynchronous Round-Robin Tournaments. CoRR abs/1804.04504 (2018) - [i18]Warut Suksompong, Charles E. Leiserson, Tao B. Schardl:
On the Efficiency of Localized Work Stealing. CoRR abs/1804.04773 (2018) - [i17]Xiaohui Bei, Guangda Huzhang, Warut Suksompong:
Truthful Fair Division without Free Disposal. CoRR abs/1804.06923 (2018) - [i16]Warut Suksompong:
Asymptotic Existence of Proportionally Fair Allocations. CoRR abs/1806.00218 (2018) - [i15]Hoon Oh, Ariel D. Procaccia, Warut Suksompong:
Fairly Allocating Many Goods with Few Queries. CoRR abs/1807.11367 (2018) - [i14]Pasin Manurangsi, Warut Suksompong:
When Do Envy-Free Allocations Exist? CoRR abs/1811.01630 (2018) - 2017
- [j9]Pasin Manurangsi, Warut Suksompong:
Asymptotic existence of fair divisions for groups. Math. Soc. Sci. 89: 100-108 (2017) - [j8]Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? SIAM J. Discret. Math. 31(3): 1751-1764 (2017) - [c6]Pasin Manurangsi, Warut Suksompong:
Computing an Approximately Optimal Agreeable Set of Items. IJCAI 2017: 338-344 - [c5]Warut Suksompong:
Fairly Allocating Contiguous Blocks of Indivisible Items. SAGT 2017: 333-344 - [c4]Ian A. Kash, Peter B. Key, Warut Suksompong:
Simple pricing schemes for the cloud. NetEcon@EC 2017: 4:1 - [c3]Ian A. Kash, Peter B. Key, Warut Suksompong:
Simple Pricing Schemes for the Cloud. WINE 2017: 311-324 - [i13]Pasin Manurangsi, Warut Suksompong:
Computing an Approximately Optimal Agreeable Set of Items. CoRR abs/1705.02748 (2017) - [i12]Tomer Ezra, Michal Feldman, Tim Roughgarden, Warut Suksompong:
Pricing Identical Items. CoRR abs/1705.06623 (2017) - [i11]Ian A. Kash, Peter B. Key, Warut Suksompong:
Simple Pricing Schemes for the Cloud. CoRR abs/1705.08563 (2017) - [i10]Charles E. Leiserson, Tao B. Schardl, Warut Suksompong:
Upper Bounds on Number of Steals in Rooted Trees. CoRR abs/1706.03184 (2017) - [i9]Pasin Manurangsi, Warut Suksompong:
Asymptotic Existence of Fair Divisions for Groups. CoRR abs/1706.08219 (2017) - [i8]Warut Suksompong:
Approximate Maximin Shares for Groups of Agents. CoRR abs/1706.09869 (2017) - [i7]Warut Suksompong:
On Black-Box Transformations in Downward-Closed Environments. CoRR abs/1707.00230 (2017) - [i6]Warut Suksompong:
Fairly Allocating Contiguous Blocks of Indivisible Items. CoRR abs/1707.00345 (2017) - [i5]Erel Segal-Halevi, Warut Suksompong:
On Democratic Fairness for Groups of Agents. CoRR abs/1709.02564 (2017) - 2016
- [j7]Felix Brandt, Markus Brill, Warut Suksompong:
An ordinal minimax theorem. Games Econ. Behav. 95: 107-112 (2016) - [j6]Warut Suksompong, Charles E. Leiserson, Tao B. Schardl:
On the efficiency of localized work stealing. Inf. Process. Lett. 116(2): 100-106 (2016) - [j5]Warut Suksompong:
Asymptotic existence of proportionally fair allocations. Math. Soc. Sci. 81: 62-65 (2016) - [j4]Charles E. Leiserson, Tao B. Schardl, Warut Suksompong:
Upper Bounds on Number of Steals in Rooted Trees. Theory Comput. Syst. 58(2): 223-240 (2016) - [j3]Warut Suksompong:
Scheduling asynchronous round-robin tournaments. Oper. Res. Lett. 44(1): 96-100 (2016) - [c2]Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? AAAI 2016: 516-522 - [c1]Warut Suksompong:
Assigning a Small Agreeable Set of Indivisible Items to Multiple Players. IJCAI 2016: 489-495 - [i4]Warut Suksompong:
Assigning a Small Agreeable Set of Indivisible Items to Multiple Players. CoRR abs/1606.08077 (2016) - 2015
- [j2]Warut Suksompong:
Individual and group stability in neutral restrictions of hedonic games. Math. Soc. Sci. 78: 1-5 (2015) - [i3]Florian Brandl, Felix Brandt, Warut Suksompong:
The Impossibility of Extending Random Dictatorship to Weak Preferences. CoRR abs/1510.07424 (2015) - [i2]Michael P. Kim, Warut Suksompong, Virginia Vassilevska Williams:
Who Can Win a Single-Elimination Tournament? CoRR abs/1511.08416 (2015) - 2014
- [j1]Sebastian A. Csar, Rik Sengupta, Warut Suksompong:
On a Subposet of the Tamari Lattice. Order 31(3): 337-363 (2014) - [i1]Felix Brandt, Markus Brill, Warut Suksompong:
An Ordinal Minimax Theorem. CoRR abs/1412.4198 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
