Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
From MaRDI portal
Publication:2115252
DOI10.1007/S10957-021-01977-XzbMATH Open1484.91016OpenAlexW3215563573MaRDI QIDQ2115252FDOQ2115252
Yiyin Cao, Chuangyin Dang, Yabin Sun
Publication date: 15 March 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01977-x
Recommendations
- A differentiable homotopy method to compute perfect equilibria
- ON GAMES OF PERFECT INFORMATION: EQUILIBRIA, ε–EQUILIBRIA AND APPROXIMATION BY SIMPLE GAMES
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- An extension of quantal response equilibrium and determination of perfect equilibrium
- scientific article; zbMATH DE number 1998538
Cites Work
- Non-cooperative games
- Equilibrium points in n -person games
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Reexamination of the perfectness concept for equilibrium points in extensive games
- The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to Numerical Continuation Methods
- Introduction to sensitivity and stability analysis in nonlinear programming
- The computation of fixed points and applications
- Sequential Equilibria
- Equilibrium Points of Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- Homotopy methods to compute equilibria in game theory
- A decomposition algorithm for \(N\)-player games
- Interior Point Methods for Nonlinear Optimization
- Refinements of the Nash equilibrium concept
- Title not available (Why is that?)
- Computing Equilibria of N-Person Games
- Computing Nash equilibria by iterated polymatrix approximation
- A global Newton method to compute Nash equilibria.
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games
- The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
- A Continuous Deformation Algorithm on the Product Space of Unit Simplices
- An algorithmic approach toward the tracing procedure for bi-matrix games
- A differentiable homotopy to compute Nash equilibria of \(n\)-person games
- General equilibrium models and homotopy methods
- The sign-based methods for solving a class of nonlinear complementarity problems
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Title not available (Why is that?)
- Two simple proofs of the feasibility of the linear tracing procedure
- Smoothing methods for nonlinear complementarity problems
- A differentiable homotopy method to compute perfect equilibria
- An interior point algorithm for mixed complementarity nonlinear problems
- An extragradient method for solving variational inequalities without monotonicity
- An extension of quantal response equilibrium and determination of perfect equilibrium
Cited In (2)
This page was built for publication: Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115252)