Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAyumi Igarashi 0001
Person information
- affiliation: Graduate School of Information Science and Technology, University of Tokyo, Japan
- affiliation (former): National Institute of Informatics, Tokyo, Japan
Other persons with the same name
- Ayumi Igarashi 0002 — Graduate School of Medicine, The University of Tokyo, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2018
[b1]Ayumi Igarashi:
Fairness and stability in structured environments. University of Oxford, UK, 2018
Journal Articles
- 2024
- [j13]Hadi Hosseini
, Zhiyi Huang, Ayumi Igarashi, Nisarg Shah:
Class fairness in online matching. Artif. Intell. 335: 104177 (2024) - [j12]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
A fair and truthful mechanism with limited subsidy. Games Econ. Behav. 144: 49-70 (2024) - [j11]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair division with two-sided preferences. Games Econ. Behav. 147: 268-287 (2024) - [j10]Ayumi Igarashi, William S. Zwicker:
Fair division of graphs and of tangled cakes. Math. Program. 203(1): 931-975 (2024) - 2023
- [j9]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) - 2022
- [j8]Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh:
Fair allocation of indivisible goods and chores. Auton. Agents Multi Agent Syst. 36(1): 3 (2022) - [j7]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost envy-free allocations with connected bundles. Games Econ. Behav. 131: 197-221 (2022) - [j6]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) - [j5]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. SIAM J. Discret. Math. 36(2): 1156-1186 (2022) - 2021
- [j4]Aishwarya Agarwal, Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling games on graphs. Artif. Intell. 301: 103576 (2021) - [j3]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) - [j2]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations for Matroid Rank Valuations. ACM Trans. Economics and Comput. 9(4): 21:1-21:41 (2021) - 2020
- [j1]Adèle Pass-Lanneau, Ayumi Igarashi, Frédéric Meunier:
Perfect graphs with polynomially computable kernels. Discret. Appl. Math. 272: 69-74 (2020)
Conference and Workshop Papers
- 2024
- [c34]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. AAAI 2024: 9773-9780 - [c33]Ayumi Igarashi, Martin Lackner, Oliviero Nardi, Arianna Novaro:
Repeated Fair Allocation of Indivisible Items. AAAI 2024: 9781-9789 - [c32]Halvard Hummel, Ayumi Igarashi:
Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division. AAMAS 2024: 852-860 - 2023
- [c31]Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi, Nisarg Shah:
Class Fairness in Online Matching. AAAI 2023: 5673-5680 - [c30]Ayumi Igarashi:
How to Cut a Discrete Cake Fairly. AAAI 2023: 5681-5688 - [c29]Ayumi Igarashi, Tomohiko Yokoyama:
Kajibuntan: A House Chore Division App. AAAI 2023: 16449-16451 - [c28]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. IJCAI 2023: 2756-2764 - 2022
- [c27]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. AAAI 2022: 4983-4990 - [c26]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. AAMAS 2022: 534-542 - [c25]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. SAGT 2022: 421-435 - [c24]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - 2021
- [c23]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
The Price of Connectivity in Fair Division. AAAI 2021: 5151-5158 - [c22]Ayumi Igarashi, Frédéric Meunier:
Envy-free Division of Multi-layered Cakes. WINE 2021: 504-521 - 2020
- [c21]Mithun Chakraborty, Ayumi Igarashi, Warut Suksompong, Yair Zick:
Weighted Envy-Freeness in Indivisible Item Allocation. AAMAS 2020: 231-239 - [c20]Hadi Hosseini, Ayumi Igarashi, Andrew Searns:
Fair Division of Time: Multi-layered Cake Cutting. IJCAI 2020: 182-188 - [c19]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations When Valuations Don't Add Up. SAGT 2020: 32-46 - [c18]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. WINE 2020: 384-397 - 2019
- [c17]Ayumi Igarashi, Dominik Peters:
Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints. AAAI 2019: 2045-2052 - [c16]Ayumi Igarashi, Jakub Sliwinski, Yair Zick:
Forming Probably Stable Communities with Limited Interactions. AAAI 2019: 2053-2060 - [c15]Robert Bredereck, Edith Elkind, Ayumi Igarashi:
Hedonic Diversity Games. AAMAS 2019: 565-573 - [c14]Ayumi Igarashi, Kazunori Ota, Yuko Sakurai, Makoto Yokoo:
Robustness against Agent Failure in Hedonic Games. AAMAS 2019: 2027-2029 - [c13]Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh:
Fair Allocation of Indivisible Goods and Chores. IJCAI 2019: 53-59 - [c12]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. IJCAI 2019: 266-272 - [c11]Ayumi Igarashi, Kazunori Ota, Yuko Sakurai, Makoto Yokoo:
Robustness against Agent Failure in Hedonic Games. IJCAI 2019: 364-370 - [c10]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. ITCS 2019: 14:1-14:21 - 2018
- [c9]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections With Diversity Constraints. AAAI 2018: 933-940 - [c8]Ayumi Igarashi, Rani Izsak, Edith Elkind:
Cooperative Games With Bounded Dependency Degree. AAAI 2018: 1063-1070 - 2017
- [c7]Ayumi Igarashi, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. AAAI 2017: 565-571 - [c6]Ayumi Igarashi, Diederik M. Roijers:
Multi-criteria Coalition Formation Games. ADT 2017: 197-213 - [c5]Ayumi Igarashi:
Supermodular Games on Social Networks. AAMAS 2017: 299-307 - [c4]Ayumi Igarashi, Robert Bredereck, Edith Elkind:
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. AAMAS 2017: 1575-1577 - [c3]Ayumi Igarashi:
Coalition Formation in Structured Environments. AAMAS 2017: 1836-1837 - [c2]Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters:
Fair Division of a Graph. IJCAI 2017: 135-141 - 2016
- [c1]Ayumi Igarashi, Edith Elkind:
Hedonic Games with Graph-restricted Communication. AAMAS 2016: 242-250
Informal and Other Publications
- 2024
- [i33]Halvard Hummel, Ayumi Igarashi:
Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division. CoRR abs/2401.14825 (2024) - [i32]Vishwa Prakash H. V., Ayumi Igarashi, Rohit Vaish:
Fair and Efficient Completion of Indivisible Goods. CoRR abs/2406.09468 (2024) - 2023
- [i31]Ayumi Igarashi, Martin Lackner, Oliviero Nardi, Arianna Novaro:
Repeated Fair Allocation of Indivisible Items. CoRR abs/2304.01644 (2023) - [i30]Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong, Sheung Man Yuen:
Reachability of Fair Allocations via Sequential Exchanges. CoRR abs/2312.07241 (2023) - 2022
- [i29]Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi, Nisarg Shah:
Class Fairness in Online Matching. CoRR abs/2203.03751 (2022) - [i28]Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita:
Fair Division with Two-Sided Preferences. CoRR abs/2206.05879 (2022) - [i27]Ayumi Igarashi:
How to cut a discrete cake fairly. CoRR abs/2209.01348 (2022) - 2021
- [i26]Ayumi Igarashi, William S. Zwicker:
Fair division of graphs and of tangled cakes. CoRR abs/2102.08560 (2021) - [i25]Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo:
Fair and Truthful Mechanism with Limited Subsidy. CoRR abs/2105.01801 (2021) - [i24]Ayumi Igarashi, Frédéric Meunier:
Envy-free division of multi-layered cakes. CoRR abs/2106.02262 (2021) - [i23]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. CoRR abs/2108.12949 (2021) - [i22]Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
The Price of Justified Representation. CoRR abs/2112.05994 (2021) - 2020
- [i21]Nawal Benabbou, Mithun Chakraborty, Ayumi Igarashi, Yair Zick:
Finding Fair and Efficient Allocations When Valuations Don't Add Up. CoRR abs/2003.07060 (2020) - [i20]Hadi Hosseini, Ayumi Igarashi, Andrew Searns:
Fair Division of Time: Multi-layered Cake Cutting. CoRR abs/2004.13397 (2020) - [i19]Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi, Pasin Manurangsi, Warut Suksompong:
Consensus Halving for Sets of Items. CoRR abs/2007.06754 (2020) - [i18]Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. CoRR abs/2007.08045 (2020) - 2019
- [i17]Edith Elkind, Jiarui Gan, Ayumi Igarashi, Warut Suksompong, Alexandros A. Voudouris:
Schelling Games on Graphs. CoRR abs/1902.07937 (2019) - [i16]Robert Bredereck, Edith Elkind, Ayumi Igarashi:
Hedonic Diversity Games. CoRR abs/1903.00303 (2019) - [i15]Ayumi Igarashi, Kazunori Ota, Yuko Sakurai, Makoto Yokoo:
Robustness against Agent Failure in Hedonic Games. CoRR abs/1903.05534 (2019) - [i14]Xiaohui Bei, Ayumi Igarashi, Xinhang Lu, Warut Suksompong:
Connected Fair Allocation of Indivisible Goods. CoRR abs/1908.05433 (2019) - 2018
- [i13]Adèle Pass-Lanneau, Ayumi Igarashi, Frédéric Meunier:
Perfect graphs with polynomially computable kernels. CoRR abs/1801.02253 (2018) - [i12]Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi:
Fair allocation of combinations of indivisible goods and chores. CoRR abs/1807.10684 (2018) - [i11]Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker:
Almost Envy-Free Allocations with Connected Bundles. CoRR abs/1808.09406 (2018) - [i10]Ayumi Igarashi, Jakub Sliwinski, Yair Zick:
Forming Probably Stable Communities with Limited Interactions. CoRR abs/1811.04616 (2018) - [i9]Ayumi Igarashi, Dominik Peters:
Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints. CoRR abs/1811.04872 (2018) - 2017
- [i8]Ayumi Igarashi, Robert Bredereck, Edith Elkind:
On Parameterized Complexity of Group Activity Selection Problems on Social Networks. CoRR abs/1703.01121 (2017) - [i7]Sylvain Bouveret, Katarína Cechlárová, Edith Elkind, Ayumi Igarashi, Dominik Peters:
Fair Division of a Graph. CoRR abs/1705.10239 (2017) - [i6]Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi, Martin Lackner, Piotr Skowron:
Multiwinner Elections with Diversity Constraints. CoRR abs/1711.06527 (2017) - [i5]Ayumi Igarashi, Rani Izsak, Edith Elkind:
Cooperative Games with Bounded Dependency Degree. CoRR abs/1711.07310 (2017) - [i4]Ayumi Igarashi, Robert Bredereck, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. CoRR abs/1712.02712 (2017) - 2016
- [i3]Ayumi Igarashi, Edith Elkind:
Hedonic Games with Graph-restricted Communication. CoRR abs/1602.05342 (2016) - [i2]Ayumi Igarashi, Dominik Peters, Edith Elkind:
Group Activity Selection on Social Networks. CoRR abs/1611.04524 (2016) - 2013
- [i1]Ayumi Igarashi, Yoshitsugu Yamamoto:
Computational complexity of the average covering tree value. CTW 2013: 223-226
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-09-02 21:18 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:
