The complexity of poset games

DOI10.7155/JGAA.00578MaRDI QIDQ5084701zbMATH OpenOpenAlexFDO

Authors Daniel Grier, Rohit Gurjar, Arpita Korwar, S. Fenner, Thomas Thierauf

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00578

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Combinatorics of partially ordered sets (06A07) Algorithmic game theory and complexity (91A68)

Recommendations

• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• scientific article; zbMATH DE number 7075886
• On the complexity of computing winning strategies for finite poset games
• Flipping the winner of a poset game
• Advances in finding ideal play on poset games

Cites work

• scientific article; zbMATH DE number 2115805 (Why is no real title available?)
• scientific article; zbMATH DE number 2124071 (Why is no real title available?)
• scientific article; zbMATH DE number 3020856 (Why is no real title available?)
• A Curious Nim-Type Game
• A complete analysis of von Neumann's Hackendot
• A deletion game on hypergraphs
• A vertex and edge deletion game on graphs
• Complexity, appeal and challenges of combinatorial games
• Flipping the winner of a poset game
• Nim-type games
• On the complexity of computing winning strategies for finite poset games
• On the complexity of some two-person perfect-information games
• Recent results and questions in combinatorial game complexities
• Winning ways for your mathematical plays. Vol. 1.

Cited in

(14)

• The parameterized complexity of positional games
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• Flipping the winner of a poset game
• scientific article; zbMATH DE number 2124071 (Why is no real title available?)
• Domino Games and Complexity
• scientific article; zbMATH DE number 7075886 (Why is no real title available?)
• Game values and computational complexity: an analysis via black-white combinatorial games
• The Game of n-Player Shove and Its Complexity
• Upper bounds on positional Paris-Harrington games
• Winning ways of weighted poset games
• On the complexity of computing winning strategies for finite poset games
• scientific article; zbMATH DE number 2086402 (Why is no real title available?)
• Advances in finding ideal play on poset games
• Pomax games -- a family of integer-valued partizan games played on posets

This page was built for publication: The complexity of poset games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084701)