Sciweavers

9 search results - page 1 / 2
» A constructive approach to sequential Nash equilibria
Sort
View
MOR
2010
106views more  MOR 2010»
13 years 3 months ago
Smoothing Techniques for Computing Nash Equilibria of Sequential Games
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
Samid Hoda, Andrew Gilpin, Javier Peña, Tuo...
IPL
2006
92views more  IPL 2006»
13 years 4 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 4 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
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...
CORR
2008
Springer
172views Education» more  CORR 2008»
13 years 5 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik