Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
From MaRDI portal
Publication:3780024
DOI10.1287/moor.12.3.377zbMath0638.90096OpenAlexW2011528476MaRDI QIDQ3780024
Ludo van der Heyden, Gerard van der Laan, Adolphus J. J. Talman
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.12.3.377
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (16)
Graph Transduction as a Noncooperative Game ⋮ Homotopy methods to compute equilibria in game theory ⋮ A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games ⋮ A dynamical neural network approach for solving stochastic two-player zero-sum games ⋮ Action-graph games ⋮ 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 ⋮ Simple search methods for finding a Nash equilibrium ⋮ Extension of GAMS for complementarity problems arising in applied economic analysis ⋮ Computational analysis of perfect-information position auctions ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ 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 ⋮ Polynomial-time computation of exact correlated equilibrium in compact games ⋮ Game Theory Explorer: software for the applied game theorist
This page was built for publication: Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
