We advocate a research approach to determining the conditions of engagement in game simulation that is a multi-disciplinary cultural and scientific inquiry at the juncture of psyc...
Ralph Noble, Kathleen Ruiz, Marc Destefano, Jonath...
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
We consider infinitary two-player perfect information games defined over graphs of configurations of a pushdown automaton. We show how to solve such games when winning condition...
Alexis-Julien Bouquet, Olivier Serre, Igor Walukie...