The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
—We examine the use of teleological metareasoning for self-adaptation in game-playing software agents. The goal of our work is to develop an interactive environment in which the ...
Joshua Jones, Chris Parnin, Avik Sinharoy, Spencer...
Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) compos...
In order to analyze or better develop modern computer games it is critical to have an appropriate representation framework. In this paper a symbolic representation of modern comput...
This illustrated paper reports on the early digital games industry in New Zealand, during the late 1970s and 80s. It presents an overview of this largely unknown history, drawing ...