The complexity of poset games
DOI10.7155/JGAA.00578zbMATH Open1490.68112OpenAlexW4205237161MaRDI QIDQ5084701FDOQ5084701
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)
Full work available at URL: https://doi.org/10.7155/jgaa.00578
Recommendations
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)
Cites Work
- Winning ways for your mathematical plays. Vol. 1.
- Title not available (Why is that?)
- On the complexity of some two-person perfect-information games
- Title not available (Why is that?)
- Complexity, appeal and challenges of combinatorial games
- A complete analysis of von Neumann's Hackendot
- A Curious Nim-Type Game
- Title not available (Why is that?)
- On the complexity of computing winning strategies for finite poset games
- Nim-type games
- Flipping the winner of a poset game
- A deletion game on hypergraphs
- Recent results and questions in combinatorial game complexities
- A vertex and edge deletion game on graphs
Cited In (14)
- On the complexity of computing winning strategies for finite poset games
- Upper bounds on positional Paris-Harrington games
- The parameterized complexity of positional games
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
- Domino Games and Complexity
- Game values and computational complexity: an analysis via black-white combinatorial games
- Winning ways of weighted poset games
- Title not available (Why is that?)
- Flipping the winner of a poset game
- Advances in finding ideal play on poset games
- Pomax games -- a family of integer-valued partizan games played on posets
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Game of n-Player Shove and Its Complexity
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)