The Complexity of Poset Games

DOI10.7155/jgaa.00578zbMath1490.68112OpenAlexW4205237161MaRDI QIDQ5084701

Arpita Korwar, Daniel Grier, Rohit Gurjar, Stephen A. 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

Mathematics Subject Classification ID

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

Cites Work

• On the complexity of computing winning strategies for finite poset games
• Flipping the winner of a poset game
• A deletion game on hypergraphs
• A complete analysis of von Neumann's Hackendot
• On the complexity of some two-person perfect-information games
• Recent results and questions in combinatorial game complexities
• Nim-type games
• Complexity, appeal and challenges of combinatorial games
• A Curious Nim-Type Game
• A vertex and edge deletion game on graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Complexity of Poset Games