Bipartite instances of INFLUENCE
From MaRDI portal
Publication:6199398
DOI10.1016/J.TCS.2023.114274arXiv2206.06118OpenAlexW4387978268MaRDI QIDQ6199398
Aline Parreau, Eric Duchêne, Nacim Oijid
Publication date: 23 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: The game INFLUENCE is a scoring combinatorial game that has been introduced in 2020 by Duchene et al. It is a good representative of Milnor's universe of scoring games, i.e. games where it is never interesting for a player to miss his turn. New general results are first given for this universe, by transposing the notions of mean and temperature derived from non-scoring combinatorial games. Such results are then applied to INFLUENCE to refine the case of unions of segments. The computational complexity of the score of the game is also solved and proved to be PSPACE-complete. We finally focus on some specific cases of INFLUENCE when the graph is bipartite, by giving explicit strategies and bounds on the optimal score on structures like grids, hypercubes or torus.
Full work available at URL: https://arxiv.org/abs/2206.06118
Cites Work
This page was built for publication: Bipartite instances of INFLUENCE
