On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games

DOI10.1287/moor.7.1.1zbMath0497.90063OpenAlexW2131552123MaRDI QIDQ3962794

Gerard van der Laan, Adolphus J. J. Talman

Publication date: 1982

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.7.1.1

zbMATH Keywords

simplicial approximationcomputation of fixed pointsproduct space of unit simplicesfixed points of upper semicontinuous point to set mappings

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Noncooperative games (91A10) Nonlinear programming (90C30) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items

A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\) ⋮ Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope ⋮ A Lower Bound Technique for Triangulations of Simplotopes ⋮ Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\) ⋮ A unifying model based on retraction for fixed point algorithms ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ Approximate Nash equilibria in anonymous games ⋮ A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm ⋮ Combinatorial integer labeling theorems on finite sets with applications ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ Robust game theory ⋮ Existence of balanced simplices on polytopes. ⋮ Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron ⋮ A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices ⋮ An algorithmic approach toward the tracing procedure for bi-matrix games