58 citations · 268 across the 37 of their papers we have counts for
39 papers · 1 filter
From Cake-Cutting and Necklace-Splitting to Fair Division of Indivisible Items
Max Dupré la Tour, Ayumi Igarashi
We give an existential transfer framework for converting continuous fair division theorems into guarantees for indivisible items arranged on a path. This allows continuous envy-fre…
Fair Allocation under Conflict Constraints
Sarfaraz Equbal, Rohit Gurjar, Ayumi Igarashi +6
We study the fair allocation of indivisible items subject to conflict constraints. In this framework, the items are represented as the vertices of a graph, with edges corresponding…
Maximin Shares with Lower Quotas
Hirota Kinoshita, Ayumi Igarashi
We study the fair division of indivisible items among agents with heterogeneous additive valuations, subject to lower and upper quotas on the number of items allocated to each…
Fair Allocation of Indivisible Goods with Variable Groups
Paul Gölz, Ayumi Igarashi, Pasin Manurangsi +1
We study the fair allocation of indivisible goods with variable groups. In this model, the goal is to partition the agents into groups of given sizes and allocate the goods to the…
Dividing Conflicting Items Fairly
Ayumi Igarashi, Pasin Manurangsi, Hirotaka Yoneda
We study the allocation of indivisible goods under conflicting constraints, represented by a graph. In this framework, vertices correspond to goods and edges correspond to conflict…
Fair and efficient allocation of indivisible items under category constraints
Ayumi Igarashi, Frédéric Meunier
We study the problem of fairly allocating indivisible goods and chores under category constraints. Specifically, there are agents and indivisible items which are partitione…
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…
Reforming an Unfair Allocation by Exchanging Goods
Sheung Man Yuen, Ayumi Igarashi, Naoyuki Kamiyama +1
Fairly allocating indivisible goods is a frequently occurring task in everyday life. Given an initial allocation of the goods, we consider the problem of reforming it via a sequenc…
Fair Division of Chores with Budget Constraints
Edith Elkind, Ayumi Igarashi, Nicholas Teh
We study fair allocation of indivisible chores to agents under budget constraints, where each chore has an objective size and disutility. This model captures scenarios where a set…
Individually Stable Dynamics in Coalition Formation over Graphs
Angelo Fanelli, Laurent Gourvès, Ayumi Igarashi +1
Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and…
Fair and Efficient Completion of Indivisible Goods
Vishwa Prakash HV, Ayumi Igarashi, Rohit Vaish
We formulate the problem of fair and efficient completion of indivisible goods, defined as follows: Given a partial allocation of indivisible goods among agents, does there exist a…
Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
Halvard Hummel, Ayumi Igarashi
We study the problem of allocating indivisible resources under the connectivity constraints of a graph . This model, initially introduced by Bouveret et al. (published in IJCAI,…
Reachability of Fair Allocations via Sequential Exchanges
Ayumi Igarashi, Naoyuki Kamiyama, Warut Suksompong +1
In the allocation of indivisible goods, a prominent fairness notion is envy-freeness up to one good (EF1). We initiate the study of reachability problems in fair division by invest…
Repeated Fair Allocation of Indivisible Items
Ayumi Igarashi, Martin Lackner, Oliviero Nardi +1
The problem of fairly allocating a set of indivisible items is a well-known challenge in the field of (computational) social choice. In this scenario, there is a fundamental incomp…
How to cut a discrete cake fairly
Ayumi Igarashi
Cake-cutting is a fundamental model of dividing a heterogeneous resource, such as land, broadcast time, and advertisement space. In this study, we consider the problem of dividing…
Fair Division with Two-Sided Preferences
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong +1
We study a fair division setting in which participants are to be fairly distributed among teams, where not only do the teams have preferences over the participants as in the canoni…
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…
The Price of Justified Representation
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi +3
In multiwinner approval voting, the goal is to select -member committees based on voters' approval ballots. A well-studied concept of proportionality in this context is the just…
Justifying Groups in Multiwinner Approval Voting
Edith Elkind, Piotr Faliszewski, Ayumi Igarashi +3
Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown thr…
Envy-free division of multi-layered cakes
Ayumi Igarashi, Frédéric Meunier
We study the problem of dividing a multi-layered cake under non-overlapping constraints. This problem, recently proposed by Hosseini et al. (IJCAI, 2020), captures several natural…
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…
Consensus Halving for Sets of Items
Paul W. Goldberg, Alexandros Hollender, Ayumi Igarashi +2
Consensus halving refers to the problem of dividing a resource into two parts so that every agent values both parts equally. Prior work has shown that when the resource is represen…
Fair Ride Allocation on a Line
Yuki Amano, Ayumi Igarashi, Yasushi Kawase +2
The airport game is a classical and well-known model of fair cost-sharing for a single facility among multiple agents. This paper extends it to the so-called assignment setting, th…
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…