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
DOI10.1287/moor.7.1.1zbMath0497.90063MaRDI 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
simplicial approximation; computation of fixed points; product space of unit simplices; fixed points of upper semicontinuous point to set mappings
65K05: Numerical mathematical programming methods
91A10: Noncooperative games
90C30: Nonlinear programming
54H25: Fixed-point and coincidence theorems (topological aspects)
Related Items
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices, Existence of balanced simplices on polytopes., 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, 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}\), 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
