Computational complexity of the average covering tree value. - Ayumi Igarashi 001; Yoshitsugu Yamamoto (CTW, 2013)

Hedonic Games with Graph-restricted Communication. - Ayumi Igarashi 001; Edith Elkind (AAMAS, 2016)

Group Activity Selection on Social Networks. - Ayumi Igarashi 001; Dominik Peters; Edith Elkind (AAAI, 2017)

Multi-criteria Coalition Formation Games. - Ayumi Igarashi 001; Diederik M. Roijers (ADT, 2017)

Supermodular Games on Social Networks. - Ayumi Igarashi 001 (AAMAS, 2017)

Coalition Formation in Structured Environments. - Ayumi Igarashi 001 (AAMAS, 2017)

On Parameterized Complexity of Group Activity Selection Problems on Social Networks. - Ayumi Igarashi 001; Robert Bredereck; Edith Elkind (AAMAS, 2017)

Fair Division of a Graph. - Sylvain Bouveret; Katarína Cechlárová; Edith Elkind; Ayumi Igarashi 001; Dominik Peters (IJCAI, 2017)

Group Activity Selection on Social Networks. - Ayumi Igarashi 001; Robert Bredereck; Dominik Peters; Edith Elkind (CoRR, 2017)

Multiwinner Elections With Diversity Constraints. - Robert Bredereck; Piotr Faliszewski; Ayumi Igarashi 001; Martin Lackner; Piotr Skowron 001 (AAAI, 2018)

Cooperative Games With Bounded Dependency Degree. - Ayumi Igarashi 001; Rani Izsak; Edith Elkind (AAAI, 2018)

Fair allocation of combinations of indivisible goods and chores. - Haris Aziz 001; Ioannis Caragiannis; Ayumi Igarashi 001 (CoRR, 2018)

Fairness and stability in structured environments. - Ayumi Igarashi 001 (2018)

Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints. - Ayumi Igarashi 001; Dominik Peters (AAAI, 2019)

Forming Probably Stable Communities with Limited Interactions. - Ayumi Igarashi 001; Jakub Sliwinski; Yair Zick (AAAI, 2019)

Hedonic Diversity Games. - Robert Bredereck; Edith Elkind; Ayumi Igarashi 001 (AAMAS, 2019)

Schelling Games on Graphs. - Edith Elkind; Jiarui Gan; Ayumi Igarashi 001; Warut Suksompong; Alexandros A. Voudouris (IJCAI, 2019)

Robustness against Agent Failure in Hedonic Games. - Ayumi Igarashi 001; Kazunori Ota; Yuko Sakurai; Makoto Yokoo (IJCAI, 2019)

Connected Fair Allocation of Indivisible Goods. - Xiaohui Bei; Ayumi Igarashi 001; Xinhang Lu; Warut Suksompong (CoRR, 2019)

Fair Division of Time: Multi-layered Cake Cutting. - Hadi Hosseini; Ayumi Igarashi 001; Andrew Searns (IJCAI, 2020)

Finding Fair and Efficient Allocations When Valuations Don't Add Up. - Nawal Benabbou; Mithun Chakraborty; Ayumi Igarashi 001; Yair Zick (SAGT, 2020)

Perfect graphs with polynomially computable kernels. - Adèle Pass-Lanneau; Ayumi Igarashi 001; Frédéric Meunier (Discret. Appl. Math., 2020)

Envy-free Division of Multi-layered Cakes. - Ayumi Igarashi 001; Frédéric Meunier (WINE, 2021)

Schelling games on graphs. - Aishwarya Agarwal; Edith Elkind; Jiarui Gan; Ayumi Igarashi 001; Warut Suksompong; Alexandros A. Voudouris (Artif. Intell., 2021)

Finding Fair and Efficient Allocations for Matroid Rank Valuations. - Nawal Benabbou; Mithun Chakraborty; Ayumi Igarashi 001; Yair Zick (ACM Trans. Economics and Comput., 2021)

Weighted Envy-freeness in Indivisible Item Allocation. - Mithun Chakraborty; Ayumi Igarashi 001; Warut Suksompong; Yair Zick (ACM Trans. Economics and Comput., 2021)

Fair allocation of indivisible goods and chores. - Haris Aziz 001; Ioannis Caragiannis; Ayumi Igarashi 001; Toby Walsh (Auton. Agents Multi Agent Syst., 2022)

Almost envy-free allocations with connected bundles. - Vittorio Bilò; Ioannis Caragiannis; Michele Flammini; Ayumi Igarashi 001; Gianpiero Monaco; Dominik Peters; Cosimo Vinci; William S. Zwicker (Games Econ. Behav., 2022)

The Price of Connectivity in Fair Division. - Xiaohui Bei; Ayumi Igarashi 001; Xinhang Lu; Warut Suksompong (SIAM J. Discret. Math., 2022)

Consensus Halving for Sets of Items. - Paul W. Goldberg; Alexandros Hollender; Ayumi Igarashi 001; Pasin Manurangsi; Warut Suksompong (Math. Oper. Res., 2022)

Kajibuntan: A House Chore Division App. - Ayumi Igarashi 001; Tomohiko Yokoyama (AAAI, 2023)

How to Cut a Discrete Cake Fairly. - Ayumi Igarashi 001 (AAAI, 2023)

Justifying groups in multiwinner approval voting. - Edith Elkind; Piotr Faliszewski; Ayumi Igarashi 001; Pasin Manurangsi; Ulrike Schmidt-Kraepelin; Warut Suksompong (Theor. Comput. Sci., 2023)

Repeated Fair Allocation of Indivisible Items. - Ayumi Igarashi 001; Martin Lackner; Oliviero Nardi; Arianna Novaro (AAAI, 2024)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division. - Halvard Hummel; Ayumi Igarashi 001 (AAMAS, 2024)

Fair Division of Chores with Budget Constraints. - Edith Elkind; Ayumi Igarashi 001; Nicholas Teh (SAGT, 2024)

Class fairness in online matching. - Hadi Hosseini; Zhiyi Huang 002; Ayumi Igarashi 001; Nisarg Shah 001 (Artif. Intell., 2024)

Reforming an Unfair Allocation by Exchanging Goods. - Sheung Man Yuen; Ayumi Igarashi 001; Naoyuki Kamiyama; Warut Suksompong (CoRR, 2024)

A fair and truthful mechanism with limited subsidy. - Hiromichi Goko; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Yu Yokoi; Makoto Yokoo (Games Econ. Behav., 2024)

Fair division with two-sided preferences. - Ayumi Igarashi 001; Yasushi Kawase; Warut Suksompong; Hanna Sumita (Games Econ. Behav., 2024)

Fair division of graphs and of tangled cakes. - Ayumi Igarashi 001; William S. Zwicker (Math. Program., 2024)

The Price of Justified Representation. - Edith Elkind; Piotr Faliszewski; Ayumi Igarashi 001; Pasin Manurangsi; Ulrike Schmidt-Kraepelin; Warut Suksompong (ACM Trans. Economics and Comput., 2024)

Reachability of Fair Allocations via Sequential Exchanges. - Ayumi Igarashi 001; Naoyuki Kamiyama; Warut Suksompong; Sheung Man Yuen (Algorithmica, 2024)

Individually Stable Dynamics in Coalition Formation over Graphs. - Angelo Fanelli 001; Laurent Gourvès; Ayumi Igarashi 001; Luca Moscardelli (AAAI, 2025)

Fair and Efficient Completion of Indivisible Goods. - Vishwa Prakash HV; Ayumi Igarashi 001; Rohit Vaish (AAAI, 2025)

Asymptotic Existence of Class Envy-free Matchings. - Tomohiko Yokoyama; Ayumi Igarashi 001 (AAMAS, 2025)

Envy-Free Division of Multilayered Cakes. - Ayumi Igarashi 001; Frédéric Meunier (Math. Oper. Res., 2025)

Fair and efficient allocation of indivisible items under category constraints. - Ayumi Igarashi 001; Frédéric Meunier (CoRR, 2025)

Fair Ride Allocation on a Line. - Yuki Amano; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hirotaka Ono 001 (ACM Trans. Economics and Comput., 2025)

Dividing Conflicting Items Fairly. - Ayumi Igarashi 001; Pasin Manurangsi; Hirotaka Yoneda (CoRR, 2025)