Equilibrium Points of Bimatrix Games

DOI10.1137/0112033zbMath0128.14804OpenAlexW2089649903WikidataQ89215904 ScholiaQ89215904MaRDI QIDQ5335815

C. E. Lemke, Joseph T. Jun. Howson

Publication date: 1964

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0112033

zbMATH Keywords

operations research

Related Items (only showing first 100 items - show all)

Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm ⋮ Γ-robust linear complementarity problems ⋮ Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ Algorithms for stochastic games ? A survey ⋮ Network routing for insurgency: An adversarial risk analysis framework ⋮ The complementarity problem ⋮ Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems ⋮ Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory ⋮ Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems ⋮ Un nuevo algoritmo para la resolucion de juegos bimatriciales ⋮ Unnamed Item ⋮ More on matrix splitting modulus-based iterative methods for solving linear complementarity problem ⋮ A dynamical neural network approach for solving stochastic two-player zero-sum games ⋮ Public goods games in directed networks ⋮ The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game ⋮ Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ The computation of pairwise stable networks ⋮ Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings ⋮ Modulus-based matrix splitting iteration methods with new splitting scheme for horizontal implicit complementarity problems ⋮ Nash equilibria in random games with right fat-tailed distributions ⋮ Generalized multilinear games and vertical tensor complementarity problems ⋮ A Metaheuristic Approach to Compute Pure Nash Equilibria ⋮ Tropical Complementarity Problems and Nash Equilibria ⋮ Consensus Game: An Extension of Battle of the Sexes Game ⋮ Interior point methods for solving Pareto eigenvalue complementarity problems ⋮ Face posets of tropical polyhedra and monomial ideals ⋮ A set intersection theorem and applications ⋮ The role of representative submatrices in vertical linear complementarity theory ⋮ On the generation of all equilibrium points for bimatrix games through the Lemke—Howson Algorithm ⋮ An Odd Theorem ⋮ Iterative algorithms for the linear complementarity problem ⋮ Models and methods of solution of quadratic integer programming problems ⋮ An associated maximization problem for two-person nonzero-sum separable games ⋮ ON FULLY SEMIMONOTONE MATRICES ⋮ A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints ⋮ Amortized Analysis of Asynchronous Price Dynamics ⋮ A fixed point theorem including the last theorem of Poincaré ⋮ Unnamed Item ⋮ An experimental study of a DC optimization algorithm for bimatrix games ⋮ The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Another note on bimatrix games ⋮ Complementarity problems ⋮ Homotopies for computation of fixed points ⋮ Bimatrix games—an addendum ⋮ On computational search for Nash equilibrium in hexamatrix games ⋮ A variable dimension algorithm for the linear complementarity problem ⋮ Approximate Equilibria for Strategic Two Person Games ⋮ Strategic Characterization of the Index of an Equilibrium ⋮ Approximate Nash Equilibria for Multi-player Games ⋮ An algorithm for the linear complementarity problem ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ Finding all solutions to polynomial systems and other systems of equations ⋮ AN APPROACH FOR SOLVING FUZZY GAMES ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Fast Algorithms for Rank-1 Bimatrix Games ⋮ Semidefinite Programming and Nash Equilibria in Bimatrix Games ⋮ Equilibrium programming:The path following approach and dynamics ⋮ Applications of Algebra for Some Game Theoretic Problems ⋮ Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods ⋮ Deflation for semismooth equations ⋮ On Random Symmetric Bimatrix Games ⋮ Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games ⋮ Some perturbation results for the Linear Complementarity Problem ⋮ A mathematical programming approach for determining oligopolistic market equilibrium ⋮ A generalized complementary pivoting algorithm ⋮ A parametric approach to complementarity theory ⋮ On the complexity of the parity argument and other inefficient proofs of existence ⋮ Riesz estimators ⋮ New trends in general variational inequalities ⋮ Layout of facilities with some fixed points ⋮ A new method for a class of linear variational inequalities ⋮ Computing approximate Nash equilibria in general network revenue management games ⋮ Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ Algorithm for cardinality-constrained quadratic optimization ⋮ On the convergence of the Lemke-Howson algorithm for bi-matrix games ⋮ PQ oligopoly, proportional rationing, and randomly ordered consumers ⋮ A decomposition algorithm for \(N\)-player games ⋮ Games of fixed rank: a hierarchy of bimatrix games ⋮ Homotopy methods to compute equilibria in game theory ⋮ Equilibrium tracing in strategic-form games ⋮ Computing equilibria: a computational complexity perspective ⋮ Enumeration of Nash equilibria for two-player games ⋮ A note on determining pure-strategy equilibrium points of bimatrix games ⋮ Equilibrium adjustment of disequilibrium prices ⋮ Constructing bimatrix games with unique equilibrium points ⋮ A theorem on the number of Nash equilibria in a bimatrix game ⋮ Criss-cross methods: A fresh view on pivot algorithms ⋮ Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games ⋮ Incompetence and impact of training in bimatrix games ⋮ A constructive proof of a permutation-based generalization of Sperner's lemma ⋮ A bounded-rationality approach to the study of noncooperative games ⋮ Fall back equilibrium for \(2 \times n\) bimatrix games ⋮ Equations on monotone graphs ⋮ Correlated equilibrium and higher order beliefs about play ⋮ How to explain a Nash equilibrium ⋮ A two-player competitive discrete location model with simultaneous decisions

This page was built for publication: Equilibrium Points of Bimatrix Games