13 citations · 29 across the 5 of their papers we have counts for
17 papers
Asymptotic Existence of Class Envy-free Matchings
Tomohiko Yokoyama, Ayumi Igarashi
We consider a one-sided matching problem where agents who are partitioned into disjoint classes and each class must receive fair treatment in a desired matching. This model, propos…
Class Fairness in Online Matching
Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi +1
In the classical version of online bipartite matching, there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that arrive online. When each i…
Fair and Truthful Mechanism with Limited Subsidy
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase +5
The notion of \emph{envy-freeness} is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guara…
Fair division of graphs and of tangled cakes
Ayumi Igarashi, William S. Zwicker
A tangle is a connected topological space constructed by gluing several copies of the unit interval . We explore which tangles guarantee envy-free allocations of connected…
Fair Division of Time: Multi-layered Cake Cutting
Hadi Hosseini, Ayumi Igarashi, Andrew Searns
We initiate the study of multi-layered cake cutting with the goal of fairly allocating multiple divisible resources (layers of a cake) among a set of agents. The key requirement is…
Robustness against Agent Failure in Hedonic Games
Ayumi Igarashi, Kazunori Ota, Yuko Sakurai +1
We study how stability can be maintained even after any set of at most k players leave their groups, in the context of hedonic games. While stability properties ensure an outcome t…