70 search results - page 11 / 14 » Polynomial Algorithms for Approximating Nash Equilibria of B... |
AAAI
2006
13 years 8 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
WINE
2005
Springer
14 years 4 days ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
ESA
2007
Springer
13 years 10 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
AAAI
2010
13 years 6 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...