Sciweavers

22 search results - page 2 / 5
» An Optimal Strategy Improvement Algorithm for Solving Parity...
Sort
View
GECCO
2009
Springer
144views Optimization» more  GECCO 2009»
13 years 11 months ago
Cheating for problem solving: a genetic algorithm with social interactions
We propose a variation of the standard genetic algorithm that incorporates social interaction between the individuals in the population. Our goal is to understand the evolutionary...
Rafael Lahoz-Beltra, Gabriela Ochoa, Uwe Aickelin
ATAL
2010
Springer
13 years 6 months ago
Heuristic search for identical payoff Bayesian games
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...
Frans A. Oliehoek, Matthijs T. J. Spaan, Jilles St...
FSTTCS
2007
Springer
13 years 11 months ago
Solving Parity Games in Big Steps
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
Sven Schewe
FORMATS
2008
Springer
13 years 6 months ago
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
CONCUR
2006
Springer
13 years 9 months ago
Strategy Improvement for Stochastic Rabin and Streett Games
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
Krishnendu Chatterjee, Thomas A. Henzinger