Bipartite instances of INFLUENCE

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)

Full work available at URL: https://arxiv.org/abs/2206.06118

zbMATH Keywords

complexitytemperaturescoring gamegame on graphsMilnor's universe

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean play of sums of positional games
• On the complexity of some two-person perfect-information games
• Games with guaranteed scores and waiting moves
• \textsc{influence}: a partizan scoring game on graphs
• The orthogonal colouring game
• The largest connected subgraph game

This page was built for publication: Bipartite instances of INFLUENCE