Homotopy methods to compute equilibria in game theory
From MaRDI portal
(Redirected from Publication:847802)
Recommendations
- A differentiable homotopy method to compute perfect equilibria
- A differentiable homotopy to compute Nash equilibria of n-person games
- Computing Nash equilibria by iterated polymatrix approximation
- A global Newton method to compute Nash equilibria.
- The complexity of the homotopy method, equilibrium selection and Lemke-Howson solutions
Cites work
- scientific article; zbMATH DE number 3837771 (Why is no real title available?)
- scientific article; zbMATH DE number 3167552 (Why is no real title available?)
- scientific article; zbMATH DE number 3809326 (Why is no real title available?)
- scientific article; zbMATH DE number 3910084 (Why is no real title available?)
- scientific article; zbMATH DE number 18247 (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 3571895 (Why is no real title available?)
- scientific article; zbMATH DE number 1099369 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- A Matrix Game Solution of the Single-Controller Stochastic Game
- A bounded-rationality approach to the study of noncooperative games
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- A differentiable homotopy to compute Nash equilibria of n-person games
- A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence
- A finite step algorithm via a bimatrix game to a single controller non- zero sum stochastic game
- A global Newton method to compute Nash equilibria.
- A globally and universally stable price adjustment process
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- A note on a theorem of F. Browder
- A path-following procedure to find a proper equilibrium of finite games
- A procedure for finding Nash equilibria in bi-matrix games
- Algorithm 652
- An algorithmic approach toward the tracing procedure for bi-matrix games
- Bayesian Equilibria of Finite Two-Person Games with Incomplete Information
- Bimatrix Equilibrium Points and Mathematical Programming
- Computation of the Nash equilibrium selected by the tracing procedure in N-person games
- Computational economics and economic theory: Substitutes or complements?
- Computing Equilibria of N-Person Games
- Computing Equilibria of Two-Person Games from the Extensive Form
- Computing Nash equilibria by iterated polymatrix approximation
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Computing Simply Stable Equilibria
- Computing Stationary Nash Equilibria of Undiscounted Single-Controller Stochastic Games
- Efficient computation of behavior strategies
- Efficient computation of equilibria for extensive two-person games
- Enumeration of Nash equilibria for two-player games
- Equilibria of Polymatrix Games
- Equilibrium Points of Bimatrix Games
- Equilibrium tracing in strategic-form games
- General equilibrium models and homotopy methods
- Nash and Walras equilibrium via Brouwer
- Nash and correlated equilibria: Some complexity considerations
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- On the Strategic Stability of Equilibria
- Polymatrix Games with Joint Constraints
- Probabilistic choice in games: properties of Rosenthal's t-solutions
- Quantal response equilibria for extensive form games
- Quantal response equilibria for normal form games
- Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
- Stationary equilibria in stochastic games: structure, selection, and computation
- The Expected Number of Nash Equilibria of a Normal Form Game
- The computation of fixed points and applications
- The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
- Two simple proofs of the feasibility of the linear tracing procedure
- Universally converging adjustment processes -- a unifying approach.
Cited in
(41)- Analysis and computation of the outcomes of pure Nash equilibria in two-player extensive-form games
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
- Determination of general equilibrium with incomplete markets and default penalties
- Slicing the Nash equilibrium manifold
- A differentiable homotopy to compute Nash equilibria of n-person games
- A differentiable homotopy method to compute perfect equilibria
- Equilibrium tracing in strategic-form games
- A differentiable path-following algorithm for computing perfect stationary points
- A User's Guide to Solving Dynamic Stochastic Games Using the Homotopy Method
- Browder’s Theorem through Brouwer’s Fixed Point Theorem
- A smooth homotopy method for incomplete markets
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- Robustness and sample complexity of model-based MARL for general-sum Markov games
- Computing equilibria for markets with constant returns production technologies
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- A differentiable path-following method to compute Nash equilibria in robust normal-form games
- How do you like your equilibrium selection problems? Hard, or very hard?
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Homotopy Continuation Method for Discounted Zero-Sum Stochastic Game with ARAT Structure
- On the stability of finding approximate fixed points by simplicial methods
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Computation of equilibrium values in the Baron and Ferejohn bargaining model
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form
- Applications of Algebra for Some Game Theoretic Problems
- On sustainable equilibria
- Computing perfect pairwise stable networks
- scientific article; zbMATH DE number 1293693 (Why is no real title available?)
- Generating empirical core size distributions of hedonic games using a Monte Carlo method
- Existence of perfect equilibria: a direct proof
- The complexity of the homotopy method, equilibrium selection and Lemke-Howson solutions
- On a theorem by Browder and its application to nonlinear boundary value problems
- On the multiplicity of solutions in generation capacity investment models with incomplete markets: a risk-averse stochastic equilibrium approach
- Browder's theorem with general parameter space
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- Semidefinite programming for min-max problems and games
- Finding all Nash equilibria of a finite game using polynomial algebra
- Computation of the Nash equilibrium selected by the tracing procedure in N-person games
- A variable-dimension homotopy on networks for computing linear spatial equilibria
- Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians
- The computation of pairwise stable networks
This page was built for publication: Homotopy methods to compute equilibria in game theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847802)
