1599 search results - page 146 / 320 » Algorithms for Parity Games |
166
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an...
165
click to vote
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
191
click to vote
SIGECOM
2006
ACM
16 years 15 days 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...
187
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
154
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...