594 search results - page 50 / 119 » Games with Secure Equilibria |
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
We present GAMUT1 , a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationshi...
AAAI
2010
13 years 8 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...
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We give derivations of two formal models of Gricean Quantity1 implicature and strong exhaustivity (Van Rooij and Schulz, 2004; Schulz and Van Rooij, 2006), in bidirectional optima...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...