Sciweavers

1599 search results - page 59 / 320
» Algorithms for Parity Games
Sort
View
ICML
2000
IEEE
16 years 5 days ago
Convergence Problems of General-Sum Multiagent Reinforcement Learning
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
Michael H. Bowling
94
Voted
CORR
2007
Springer
102views Education» more  CORR 2007»
14 years 11 months ago
Solving Triangular Peg Solitaire
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg a...
George I. Bell
JAIR
2008
119views more  JAIR 2008»
14 years 11 months ago
A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
Sherief Abdallah, Victor R. Lesser
GECCO
2006
Springer
189views Optimization» more  GECCO 2006»
15 years 3 months 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»
14 years 11 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,...