Michael Coulombe (Massachusetts Institute of Technology) |
Jayson Lynch (Cheriton School of Computer Science, University of Waterloo) |
In this paper we define a new model of limited communication for multiplayer team games of imperfect information. We prove that the Team DFA Game and Team Formula Game, which have bounded state, remain undecidable when players have a rate of communication which is less than the rate at which they make moves in the game. We also show that meeting this communication threshold causes these games to be decidable. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.370.14 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |