24 search results - page 4 / 5 » On the Performance of Approximate Equilibria in Congestion G... |
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...
SAGA
2007
Springer
13 years 12 months ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
SIGECOM
2010
ACM
13 years 10 months 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...
ICC
2007
IEEE
14 years 3 days ago
2007
IEEE
Abstract— We describe a decentralized learning-based activation algorithm for a ZigBee-enabled unattended ground sensor network. Sensor nodes learn to monitor their environment i...
AAAI
2012
11 years 8 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...