This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
This paper treats the problem of distributed planning in general-sum stochastic games with communication when the model is known. Our main contribution is a novel, game theoretic ...
The emergence of online games has fundamentally changed security requirements for computer games, which previously were largely concerned with copy protection. In this paper, we e...
For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property,...
While pervasive technologies explore new gaming styles, traditional games, such as cards and tabletop games are still appealing and have various irreplaceable flavors. We point ou...