Sciweavers

800 search results - page 50 / 160
» On the Complexity of Parity Games
Sort
View
SIGECOM
2005
ACM
97views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Complexity of (iterated) dominance
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
Vincent Conitzer, Tuomas Sandholm
AAAI
2004
13 years 10 months ago
AI Characters and Directors for Interactive Computer Games
We are creating an environment for investigating the role of advanced AI in interactive, story-based computer games. This environment is based on the Unreal Tournament (UT) game e...
Brian Magerko, John E. Laird, Mazin Assanie, Alex ...
IWEC
2004
13 years 10 months ago
Game-Driven Intelligent Tutoring Systems
With the increase of computer capabilities, many learning systems have become complex simulators with advanced interfaces close to game quality. However, many games features have n...
Marco Antonio Gómez-Martín, Pedro Pa...
ATAL
2006
Springer
14 years 1 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
FSTTCS
2010
Springer
13 years 7 months ago
Generalized Mean-payoff and Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...