5 citations · 11 across the 22 of their papers we have counts for
4 papers · 1 filter
Rerouting Planar Curves and Disjoint Paths
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +5
In this paper, we consider a transformation of disjoint paths in a graph. For a graph and a pair of disjoint paths and connecting the same set o…
On Reachable Assignments under Dichotomous Preferences
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama +4
We consider the problem of determining whether a target item assignment can be reached from an initial item assignment by a sequence of pairwise exchanges of items between agents.…
Reforming an Envy-Free Matching
Takehiro Ito, Yuni Iwamasa, Naonori Kakimura +5
We consider the problem of reforming an envy-free matching when each agent is assigned a single item. Given an envy-free matching, we consider an operation to exchange the item of…
Online Task Assignment Problems with Reusable Resources
Hanna Sumita, Shinji Ito, Kei Takemura +4
We study online task assignment problem with reusable resources, motivated by practical applications such as ridesharing, crowdsourcing and job hiring. In the problem, we are given…