Sciweavers

14084 search results - page 47 / 2817
» A Theory for Game Theories
Sort
View
MST
2011
237views Hardware» more  MST 2011»
13 years 2 months ago
On the Complexity of Computing Winning Strategies for Finite Poset Games
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
Michael Soltys, Craig Wilson
ATAL
2009
Springer
14 years 2 months ago
A logic of games and propositional control
We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outco...
Nicolas Troquard, Wiebe van der Hoek, Michael Wool...
ATAL
2007
Springer
14 years 2 months ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser
ALDT
2009
Springer
207views Algorithms» more  ALDT 2009»
14 years 2 months ago
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
We present an anytime multiagent learning approach to satisfy any given optimality criterion in repeated game self-play. Our approach is opposed to classical learning approaches fo...
Andriy Burkov, Brahim Chaib-draa
ILC
2007
Springer
14 years 2 months ago
A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
Jacques Duparc, Alessandro Facchini