The set coincidence game: Complexity, attainability, and symmetric strategies

DOI10.1016/0022-0000(89)90028-7zbMath0689.68068OpenAlexW2012185194MaRDI QIDQ582100

Jianyong Qiao, Sumit K. Garg

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90028-7

zbMATH Keywords

complexity theoryattainabilitySet Coincidence Game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Graph theory (05C99)

Related Items (3)

On the set coincidence game ⋮ The isolation game for regular graphs ⋮ On Ringeisen's isolation game. II

Cites Work

• On Ringeisen's isolation game
• On the complexity of chess
• The isolation game for regular graphs
• On the complexity of some two-person perfect-information games
• Variations on a game
• A Combinatorial Problem Which Is Complete in Polynomial Space
• Bottleneck extrema
• Extensive Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The set coincidence game: Complexity, attainability, and symmetric strategies