1599 search results - page 92 / 320 » Algorithms for Parity Games |
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
In a buyer-supplier game, a special type of assignment game, a distinguished player, called the buyer, wishes to purchase some combinatorial structure. A set of players, called sup...
114
click to vote
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Most modern real-time strategy computer games have a sophisticated but fixed ‘AI’ component that controls the computer’s actions. Once the user has learned how suc...
SAGT
2009
Springer
15 years 6 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
111
click to vote
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...