A sequence-form differentiable path-following method to compute Nash equilibria
From MaRDI portal
Cites work
- A course in game theory.
- A differentiable homotopy method to compute perfect equilibria
- A differentiable homotopy to compute Nash equilibria of n-person games
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- A global Newton method to compute Nash equilibria.
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- A procedure for finding Nash equilibria in bi-matrix games
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Computation of the Nash equilibrium selected by the tracing procedure in N-person games
- Computing a quasi-perfect equilibrium of a two-player game
- Computing Equilibria of N-Person Games
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Efficient computation of behavior strategies
- Efficient computation of equilibria for extensive two-person games
- Equilibrium Points of Bimatrix Games
- Extensive Games
- Finding mixed strategies with small supports in extensive form games
- General equilibrium models and homotopy methods
- scientific article; zbMATH DE number 3167552 (Why is no real title available?)
- scientific article; zbMATH DE number 4141836 (Why is no real title available?)
- scientific article; zbMATH DE number 3809326 (Why is no real title available?)
- scientific article; zbMATH DE number 47120 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 3436963 (Why is no real title available?)
- scientific article; zbMATH DE number 3078991 (Why is no real title available?)
- Introduction to sensitivity and stability analysis in nonlinear programming
- Microeconomic theory
- Nash Equilibrium and Welfare Optimality
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Refinements of the Nash equilibrium concept
- Representations and solutions for game-theoretic problems
- Sequential Equilibria
- Structure theorems for game trees
- The complexity of two-person zero-sum games in extensive form
- The computational complexity of trembling hand perfection and other equilibrium refinements
This page was built for publication: A sequence-form differentiable path-following method to compute Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6937395)
