1410 search results - page 81 / 282 » The Algorithmics of Solitaire-Like Games |
AAAI
2010
14 years 11 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In artificial intelligence literature there is a rising interest in studying strategic interaction situations. In these situations a number of rational agents act strateg...
ESA
2010
Springer
15 years 11 days ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
119
click to vote
ESA
2010
Springer
15 years 11 days ago
2010
Springer
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...