Sciweavers

800 search results - page 75 / 160
» On the Complexity of Parity Games
Sort
View
AAAI
2000
13 years 10 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
14 years 27 days ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
GAMEON
2003
13 years 10 months ago
Multi-Agent Based Modelling: from Social Simulation to Real Time Strategy Games
Simulation has been regarded as the third way to represent social models, alternative to other two symbol systems: the verbal argumentation and the mathematical one. Simulation ca...
Marco Remondino
FLAIRS
2009
13 years 7 months ago
Making User-Defined Interactive Game Characters BEHAVE
With the most resource intensive tasks in games offloaded to special purpose processors, game designers now have the opportunity to build richer characters using more complex AI t...
Frederick W. P. Heckel, G. Michael Youngblood, D. ...
ISCIS
2004
Springer
14 years 2 months ago
Modelling Role-Playing Games Using PEPA Nets
Abstract. We present a performance modelling case study of a distributed multi-player game expressed in the PEPA nets modelling language. The case study provides a modern complex d...
Stephen Gilmore, Leïla Kloul, Davide Piazza