Characterizing the Decidability of Finite State Automata Team Games with Communication

September 21, 2022 · The Ethereal · 🏛 International Symposium on Games, Automata, Logics and Formal Verification

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Michael Coulombe, Jayson Lynch arXiv ID 2209.10324 Category cs.CC: Computational Complexity Cross-listed cs.DS Citations 0 Venue International Symposium on Games, Automata, Logics and Formal Verification Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity