Sciweavers

40 search results - page 8 / 8
» Fast winning strategies in positional games
Sort
View
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 9 days ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer
LPAR
2004
Springer
13 years 11 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
ICML
2001
IEEE
14 years 6 months ago
Convergence of Gradient Dynamics with a Variable Learning Rate
As multiagent environments become more prevalent we need to understand how this changes the agent-based paradigm. One aspect that is heavily affected by the presence of multiple a...
Michael H. Bowling, Manuela M. Veloso
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 6 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
13 years 10 months ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein