On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
From MaRDI portal
Publication:3962794
Cited in
(17)- Some computational methods for systems of nonlinear equations and systems of polynomial equations
- An algorithmic approach toward the tracing procedure for bi-matrix games
- A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\)
- Approximate Nash equilibria in anonymous games
- Robust game theory
- A direct reduction from k-player to 2-player approximate Nash equilibrium
- A unifying model based on retraction for fixed point algorithms
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope
- A lower bound technique for triangulations of simplotopes
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Existence of balanced simplices on polytopes.
- A sequence-form differentiable path-following method to compute Nash equilibria
- Computation of the Nash equilibrium selected by the tracing procedure in N-person games
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
- Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\)
- Combinatorial integer labeling theorems on finite sets with applications
This page was built for publication: On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962794)
