\textsc{influence}: a partizan scoring game on graphs

DOI10.1016/j.tcs.2021.05.028OpenAlexW3165348785MaRDI QIDQ2043009

Eric Rémila, Stéphane Gonzalez, Aline Parreau, Philippe Solal, Eric Duchêne

Publication date: 22 July 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

games on graphstwo-player gamesscoring combinatorial games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

On a vertex-capturing game ⋮ Smash and grab: the \(0 \cdot 6\) scoring game on graphs ⋮ Bipartite instances of INFLUENCE ⋮ The complexity of two colouring games ⋮ The largest connected subgraph game ⋮ The largest connected subgraph game

Cites Work

• Unnamed Item
• Unnamed Item
• Guaranteed scoring games
• The theory of judgment aggregation: an introductory review
• Occupation games on graphs in which the second player takes almost all vertices
• Mean play of sums of positional games
• The median game
• Games with guaranteed scores and waiting moves
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Scoring Play Combinatorial Games
• Reaching a Consensus
• A Graph-Grabbing Game
• Strategic Influence in Social Networks

This page was built for publication: \textsc{influence}: a partizan scoring game on graphs