Hironori Kiya

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 12

Top Topics

Winner Determination

Nash Equilibrium

Additively Separable

Graph Structures

Top Venues

Discret. Appl. Math.

Publications

Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari
Faster Winner Determination Algorithms for (Colored) Arc Kayles. SOFSEM (2024)
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
Winner Determination Algorithms for Graph Games with Matching Structures. Algorithmica 86 (3) (2024)
Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono
Turning Tiles is PSPACE-complete. CoRR (2023)
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
Sequentially Swapping Tokens: Further on Graph Classes. SOFSEM (2023)
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. Discret. Appl. Math. 321 (2022)
Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Kanae Yoshiwatari
Winner Determination Algorithms for Graph Games with Matching Structures. CoRR (2022)
Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono
Winner Determination Algorithms for Graph Games with Matching Structures. IWOCA (2022)
Hironori Kiya, Yuto Okada, Hirotaka Ono, Yota Otachi
Sequentially Swapping Tokens: Further on Graph Classes. CoRR (2022)
Hironori Kiya, Katsuki Ohto, Hirotaka Ono
Computing the Winner of 2-Player TANHINMIN. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2021)
Naoka Fukuzono, Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Ryogo Yamaguchi
Two-Player Competitive Diffusion Game: Graph Classes and the Existence of a Nash Equilibrium. SOFSEM (2020)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
Computational Complexity of Hedonic Games on Sparse Graphs. PRIMA (2019)
Tesshu Hanaka, Hironori Kiya, Yasuhide Maei, Hirotaka Ono
Computational Complexity of Hedonic Games on Sparse Graphs. CoRR (2019)