Generalized linear complementarity in a problem of \(n\)-person games

DOI10.1007/BF01540162zbMath0865.90143OpenAlexW2047143626MaRDI QIDQ2564339

S. R. Mohan, S. K. Neogy

Publication date: 19 March 1997

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01540162

zbMATH Keywords

stabilitydegree theorygeneralized linear complementarity\(\varepsilon\)-equilibrium setcomputing an equilibrium set of strategiesgeneralization of the polymatrix game

Mathematics Subject Classification ID

Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

Generalized multilinear games and vertical tensor complementarity problems

Cites Work

• Unnamed Item
• Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
• Copositive-plus Lemke algorithm solves polymatrix games
• The generalized Leontief input-output model and its application to the choice of new technology
• A generalization of the Nash equilibrium theorem on bimatrix games
• Non-cooperative games
• Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
• Applications of Degree Theory to Linear Complementarity Problems
• Some classes of matrices in linear complementarity theory
• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• A generalization of the linear complementarity problem
• Equilibria of Polymatrix Games

This page was built for publication: Generalized linear complementarity in a problem of \(n\)-person games