Sciweavers

3780 search results - page 60 / 756
» Algorithms for Game Metrics
Sort
View
LICS
2010
IEEE
13 years 7 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
NIPS
2003
13 years 10 months ago
Applying Metric-Trees to Belief-Point POMDPs
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
GECCO
2006
Springer
189views Optimization» more  GECCO 2006»
14 years 13 days ago
Game theory as a new paradigm for phenotype characterization of genetic algorithms
In this paper, it is presented a new way to characterize the phenotype in the context of Genetic Algorithms through the use of Game Theory as a theoretical foundation to define a ...
Otávio Noura Teixeira, Artur Noura Teixeira...
ECCC
2006
71views more  ECCC 2006»
13 years 8 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
ATAL
2009
Springer
14 years 3 months ago
Multiagent reinforcement learning: algorithm converging to Nash equilibrium in general-sum discounted stochastic games
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
Natalia Akchurina