1 citations · 1 across the 16 of their papers we have counts for
6 papers · 1 filter
Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense
Tesshu Hanaka, Nicolás Honorato-Droguett, Hirotaka Ono +2
In this paper, we study graph editing problems on geometric intersection graphs. For a tuple of geometric objects in some Euclidean space, let $G_\mat…
Multi-Winner Voting with Argumentative Ballots
Ryuta Arisaka, Hirotaka Ono
We introduce multi-winner voting with argumentative ballots (MVArg) and investigate theoretical properties. As our conceptual contribution, we generalise approval ballots to argume…
A Moderatorless Protocol for WEREWOLF
Naoki Kitamura, Hironori Kiya, Hirotaka Ono
Social deduction games, or hidden-role games, are multiplayer games in which players are assigned private roles and act under asymmetric information about other players' roles and…
Arrow-Type Impossibility for Genuinely Modal Judgments
Yutaka Nagai, Hirotaka Ono
Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficientl…
Game-Theoretic and Algorithmic Analyses of Multi-Agent Routing under Crossing Costs
Tesshu Hanaka, Nikolaos Melissinos, Hirotaka Ono
Coordinating the movement of multiple autonomous agents over a shared network is a fundamental challenge in algorithmic robotics, intelligent transportation, and distributed system…
The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
Kenta Komoto, Kazuhiro Kurita, Hirotaka Ono
Frequent tree mining asks us to enumerate tree patterns that occur frequently in a database of rooted trees. This problem is motivated by tree-structured data in bioinformatics, su…