224 search results - page 31 / 45 » On Nash-Equilibria of Approximation-Stable Games |
AAAI
2006
13 years 9 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...
COMCOM
2008
13 years 7 months ago
2008
A user located in a congested area of a wireless LAN may benefit by moving to a less-crowded area and using a less-loaded access point. This idea has gained attention from research...
AAAI
2012
11 years 10 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
SIGECOM
2010
ACM
14 years 10 days ago
2010
ACM
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...