5995 search results - page 105 / 1199 » Algorithmic Game Theory |
136
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a game setting called a joint process, where the history of actions determine the state, and the state and agent properties determine the payoff. This setting is a sp...
133
Voted
ACG
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
213
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
126
Voted
KI
2011
Springer
14 years 10 months ago
2011
Springer
We have parallelized our general game player Ary on a cluster of computers. We propose multiple parallelization algorithms. For the sake of simplicity all our algorithms have proce...
143
click to vote
ACG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...