default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWarut Suksompong
- > Home > Persons > Warut Suksompong
Publications
- 2024
[j55]Ayumi Igarashi
, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair division with two-sided preferences. Games Econ. Behav. 147: 268-287 (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) - [c49]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. AAAI 2024: 9773-9780 - 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) - [c40]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. IJCAI 2023: 2756-2764 - [i60]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. CoRR abs/2312.07241 (2023) - 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) - [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) - [c35]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c32]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - [i56]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. CoRR abs/2206.05879 (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) - [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 - [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) - [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
- [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 - [i34]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. CoRR abs/2007.06754 (2020) - 2019
- [c12]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. IJCAI 2019: 266-272 - [i29]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. CoRR abs/1902.07937 (2019) - [i26]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
Connected Fair Allocation of Indivisible Goods. CoRR abs/1908.05433 (2019)
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-09-21 02:37 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:
