Sciweavers

234 search results - page 10 / 47
» A polynomial-time nash equilibrium algorithm for repeated ga...
Sort
View

Presentation
1554views
16 years 9 months ago
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources
NECTAR : Nash Equillibrium CompuTation Algorithms and Resources, Poster Presentation at Microsoft TechVista Delhi. (October 2007)
Sujit Gujar, Rama Suri Narayanam, Y Narahari
FORMATS
2010
Springer
14 years 7 months ago
Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
Patricia Bouyer, Romain Brenguier, Nicolas Markey
JSAC
2007
189views more  JSAC 2007»
14 years 9 months ago
Non-Cooperative Power Control for Wireless Ad Hoc Networks with Repeated Games
— One of the distinctive features in a wireless ad hoc network is lack of any central controller or single point of authority, in which each node/link then makes its own decision...
Chengnian Long, Qian Zhang, Bo Li, Huilong Yang, X...
AAAI
2006
14 years 11 months ago
Algorithms for Rationalizability and CURB Sets
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...
Michael Benisch, George B. Davis, Tuomas Sandholm
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
14 years 8 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...