2 citations · 2 across the 5 of their papers we have counts for
7 papers
Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs
Tesshu Hanaka, Airi Ikeyama, Hirotaka Ono
Fractional hedonic games are coalition formation games where a player's utility is determined by the average value they assign to the members of their coalition. These games are a…
Turning Tiles is PSPACE-complete
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu +2
In combinatorial game theory, the winning player for a position in normal play is analyzed and characterized via algebraic operations. Such analyses define a value for each positio…
Reallocation Problems with Minimum Completion Time
Toshimasa Ishii, Jun Kawahara, Kazuhisa Makino +1
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce…
Capacitated Network Design Games on a Generalized Fair Allocation Model
Tesshu Hanaka, Toshiyuki Hirose, Hirotaka Ono
The cost-sharing connection game is a variant of routing games on a network. In this model, given a directed graph with edge costs and edge capacities, each agent wants to construc…
Computing -Labeling with Combined Parameters
Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
Given a graph, an -labeling of the graph is an assignment from the vertex set to the set of nonnegative integers such that for any pair of vertices $(u,v),|f (u) - f (v…
Parameterized Complexity of -Path Packing
Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki +6
Given a graph , , and integers and , the \textsc{-Path Packing} problem asks to find vertex-disjoint paths of length that h…
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…