Sciweavers

14 search results - page 3 / 3
» An Approximate Subgame-Perfect Equilibrium Computation Techn...
Sort
View
ATAL
2007
Springer
13 years 11 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
WINE
2007
Springer
166views Economy» more  WINE 2007»
13 years 11 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
AAAI
2007
13 years 8 months ago
A New Algorithm for Generating Equilibria in Massive Zero-Sum Games
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
Martin Zinkevich, Michael H. Bowling, Neil Burch
TON
2008
139views more  TON 2008»
13 years 5 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli