On the Complexity of Chooser–Picker Positional Games

DOI10.1515/integ.2011.113zbMath1242.91023arXiv1605.05430OpenAlexW2330456502MaRDI QIDQ2898395

András Csernenszky, Ryan R. Martin, András Pluhár

Publication date: 11 July 2012

Published in: Integers (Search for Journal in Brave)

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

zbMATH Keywords

complexitypairingspositional gamespicker-chooser gamessnaky

Mathematics Subject Classification ID

Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (8)

Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Generalized pairing strategies -- a bridge from pairing strategies to colorings ⋮ The picker-chooser diameter game ⋮ Online chromatic number is PSPACE-complete ⋮ The pairing strategies of the 9-in-a-row game ⋮ Unnamed Item ⋮ On solving the 7,7,5-game and the 8,8,5-game ⋮ On chooser-picker positional games

This page was built for publication: On the Complexity of Chooser–Picker Positional Games