License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2018.14
URN: urn:nbn:de:0030-drops-88051
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8805/
Coulombe, Michael J. ;
Lynch, Jayson
Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games
Abstract
We show the undecidability of whether a team has a forced win in a number of well known video games including: Team Fortress 2, Super Smash Brothers: Brawl, and Mario Kart.To do so, we give a simplification of the Team Computation Game [Hearn and Demaine, 2009] and use that to give an undecidable abstract game on graphs. This graph game framework better captures the geometry and common constraints in many games and is thus a powerful tool for showing their computational complexity.
BibTeX - Entry
@InProceedings{coulombe_et_al:LIPIcs:2018:8805,
author = {Michael J. Coulombe and Jayson Lynch},
title = {{Cooperating in Video Gamesl Impossible! Undecidability of Team Multiplayer Games}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8805},
URN = {urn:nbn:de:0030-drops-88051},
doi = {10.4230/LIPIcs.FUN.2018.14},
annote = {Keywords: computational complexity, undecidable, team games, imperfect information}
}
|
Keywords: |
|
computational complexity, undecidable, team games, imperfect information |
|
Collection: |
|
9th International Conference on Fun with Algorithms (FUN 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.06.2018 |
