58 citations · 268 across the 37 of their papers we have counts for
5 papers · 1 filter
Pareto-Optimal Allocation of Indivisible Goods with Connectivity Constraints
Ayumi Igarashi, Dominik Peters
We study the problem of allocating indivisible items to agents with additive valuations, under the additional constraint that bundles must be connected in an underlying item graph.…
Forming Probably Stable Communities with Limited Interactions
Ayumi Igarashi, Jakub Sliwinski, Yair Zick
A community needs to be partitioned into disjoint groups; each community member has an underlying preference over the groups that they would want to be a member of. We are interest…
Almost Envy-Free Allocations with Connected Bundles
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini +5
We study the existence of allocations of indivisible goods that are envy-free up to one good (EF1), under the additional constraint that each bundle needs to be connected in an und…
Fair allocation of combinations of indivisible goods and chores
Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi +1
We consider the problem of fairly dividing a set of items. Much of the fair division literature assumes that the items are `goods' i.e., they yield positive utility for the agents.…
Perfect graphs with polynomially computable kernels
Adèle Pass-Lanneau, Ayumi Igarashi, Frédéric Meunier
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the exist…