Structure theorems for game trees

DOI10.1073/PNAS.082249599MaRDI QIDQ4547720zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

behavior strategycorresponding game freeNash equilibrium

Mathematics Subject Classification ID

Noncooperative games (91A10) Games in extensive form (91A18)

Recommendations

• A general structure theorem for the Nash equilibrium correspondence
• On (un)knots and dynamics in games
• On the topology of the set of Nash equilibria
• scientific article; zbMATH DE number 1842070
• Further results on essential Nash equilibria in normal-form games

Cites work

• A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
• A convergent process of price adjustment and global Newton methods
• Direct Proofs of Generic Finiteness of Nash Equilibrium Outcomes
• Efficient computation of behavior strategies
• On the Strategic Stability of Equilibria
• Sequential Equilibria

Cited in

(29)

• Global Newton method for stochastic games
• A direct independence proof of Buchholz's Hydra Game on finite labeled trees
• A global Newton method to compute Nash equilibria.
• Axiomatization of an allocation rule for ordered tree TU-games
• The eigen-distribution of weighted game trees
• On (un)knots and dynamics in games
• Games of incomplete information and myopic equilibria
• Logit equilibrium as an approximation of Nash equilibrium
• A general structure theorem for the Nash equilibrium correspondence
• Measure Properties of Game Tree Languages
• Some results concerning the solution mappings of mixed variational inequality problems
• The Computational Complexity of Game Trees by Eigen-Distribution
• Thick Subtrees, Games and Experiments
• scientific article; zbMATH DE number 3902439 (Why is no real title available?)
• scientific article; zbMATH DE number 6829368 (Why is no real title available?)
• scientific article; zbMATH DE number 2086645 (Why is no real title available?)
• Extended Sprague–Grundy theory for locally finite games, and applications to random game-trees
• scientific article; zbMATH DE number 7614167 (Why is no real title available?)
• Disks on a Tree: Analysis of a Combinatorial Game
• Fundamentals of Computation Theory
• Lit-only \(\sigma \)-game on pseudo-trees
• Slicing the Nash equilibrium manifold
• Polytope-form games and index/degree theories for extensive-form games
• A sequence-form differentiable path-following method to compute Nash equilibria
• Analysis and computation of the outcomes of pure Nash equilibria in two-player extensive-form games
• Solid outcomes in finite games
• Quadratic programming approach for Nash equilibrium computation in multiplayer imperfect-information games
• A decomposition algorithm for N-player games
• Computing Nash equilibria by iterated polymatrix approximation

This page was built for publication: Structure theorems for game trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547720)