: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
In order to succeed, agents playing games must reason about the mechanics of the game, the strategies of other agents, other agents’ reasoning about their strategies, and the ra...
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...
We introduce scalability for computer games as the next frontier for techniques from data management. A very important aspect of computer games is the artificial intelligence (AI)...
Walker M. White, Alan J. Demers, Christoph Koch, J...