Sciweavers

1698 search results - page 15 / 340
» Growing Complex Games
Sort
View
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm
JELIA
2004
Springer
15 years 9 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
AUGHUMAN
2011
14 years 11 months ago
Full body interaction for serious games in motor rehabilitation
Serious games and especially their use in healthcare applications are an active and rapidly growing area of research. A key aspect of games in rehabilitation is 3D input. In this ...
Christian Schönauer, Thomas Pintaric, Hannes ...
ATAL
2007
Springer
15 years 10 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
15 years 10 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...