Structure theorems for game trees
From MaRDI portal
Publication:4547720
DOI10.1073/pnas.082249599zbMath1050.91006WikidataQ34074030 ScholiaQ34074030MaRDI QIDQ4547720
Srihari Govindan, Robert Wilson
Publication date: 11 September 2002
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: http://www.pnas.org/content/vol99/issue13/#ECONOMIC_SCIENCES
Related Items
A decomposition algorithm for \(N\)-player games, Computing Nash equilibria by iterated polymatrix approximation, Global Newton method for stochastic games, A global Newton method to compute Nash equilibria.
Cites Work
- A convergent process of price adjustment and global Newton methods
- Efficient computation of behavior strategies
- A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
- Sequential Equilibria
- Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes
- On the Strategic Stability of Equilibria