601 search results - page 56 / 121 » Playing large games using simple strategies |
138
click to vote
SIGECOM
2006
ACM
15 years 7 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
135
click to vote
FSTTCS
2010
Springer
14 years 11 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
115
click to vote
LPAR
2004
Springer
15 years 6 months ago
2004
Springer
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...
133
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
126
click to vote
EWCBR
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we propose an approach to address the old problem of identifying the feature conditions under which a gaming strategy can be effective. For doing this, we will build ...