Maker-Maker and Maker-Breaker Games are PSPACE-Complete

Forfattere

  • Jesper Makholm Byskov

DOI:

https://doi.org/10.7146/brics.v11i14.21839

Resumé

We show that the problems of deciding the outcome of Maker-Maker and Maker-Breaker games played on arbitrary hypergraphs are PSPACE-complete. Maker-Breaker games have earlier been shown PSPACE-complete by Schaefer (1978); we give a simpler proof and show a reduction from Maker-Maker games to Maker-Breaker games.

Downloads

Publiceret

2004-08-11

Citation/Eksport

Byskov, J. M. (2004). Maker-Maker and Maker-Breaker Games are PSPACE-Complete. BRICS Report Series, 11(14). https://doi.org/10.7146/brics.v11i14.21839

Nummer

Nr. 14 (2004): RS-14 Maker-Maker and Maker-Breaker Games are PSPACE-Complete

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).