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

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, An approach for reducing the graphical model and genetic algorithm for computing approximate Nash equilibrium in static games, On equilibria in finite games, Application of primitive sets to multi-criteria optimization problems, Correlated equilibria in continuous games: characterization and computation, On mutual concavity and strategically-zero-sum bimatrix games, A high accuracy method for solving ODEs with discontinuous right-hand side, Exponential lower bounds for finding Brouwer fixed points, On the Knaster-Kuratowski-Mazurkiewicz-Shapley theorem, Lemke's method - a recursive approach, On taxed matrix games and changes in the expected transfer, On perfect Nash equilibria of polymatrix games, Recent development in computational complexity characterization of Nash equilibrium, Equilibria, fixed points, and complexity classes, Nash equilibria: complexity, symmetries, and approximation, Polymatrix games and optimization problems, Games in oriented matroids, On linear fractional programming problem and its computation using a neural network model, Nonlinear programming and stationary equilibria in stochastic games, On the robustness of the competitive equilibrium: utility-improvements and equilibrium points, Implementing the modified LH algorithm, New complexity results about Nash equilibria, Simple search methods for finding a Nash equilibrium, Computing the cores of strategic games with punishment-dominance relations, Semidefinite programming for min-max problems and games, Copositive-plus Lemke algorithm solves polymatrix games, Enumeration of PLCP-orientations of the 4-cube, Exponentiality of the exchange algorithm for finding another room-partitioning, Extension of GAMS for complementarity problems arising in applied economic analysis, Constructive characterization of Lipschitzian \(Q_ 0\)-matrices, George Dantzig in the development of economic analysis, Computing Nash equilibria by iterated polymatrix approximation, On Stackelberg mixed strategies, On the complexity of deciding bimatrix games similarity, Generalized bilinear programming. I: Models, applications and linear programming relaxation, Formulating an \(n\)-person noncooperative game as a tensor complementarity problem, A path-following procedure to find a proper equilibrium of finite games, A field guide to the matrix classes found in the literature of the linear complementarity problem, A unified approach to complementarity in optimization, Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games, Well supported approximate equilibria in bimatrix games, Sandwich method for finding fixed points, A parametric representation of totally mixed Nash equilibria, On the simplex method and a class of linear complementarity problems, Existence of equilibrium pairs in continuous games, Imitation games and computation, Critical infrastructure protection using secrecy -- a discrete simultaneous game, On the solution of large, structured linear complementarity problems: The tridiagonal case, Separable and low-rank continuous games, Uniqueness of equilibrium points in bimatrix games, A re-evaluation of perfect competition as the solution to the Bertrand price game, Theorems on closed coverings of a simplex and their applications to cooperative game theory, Polynomial algorithms for approximating Nash equilibria of bimatrix games, A simplicial approach for discrete fixed point theorems, Existence of equilibria in a decentralized two-level supply chain, Equilibrium points in special n-person games, Constrained nonzero-sum games with partially controllable strategies, Linear quadratic programming in oriented matroids, Technical note: Games with vector payoffs, Perspectives on multiagent learning, On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games, The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix, The transition from a Drèze equilibrium to a Walrasian equilibrium, Strictly perfect equilibrium points of bimatrix games, Cost allocation in the Chinese postman problem, A generalization of an oddness-theorem for bimatrix games, Degeneracy in linear complementarity problems: A survey, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Tolerance approach to sensitivity analysis in linear complementarity problems, 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 novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes, A pathsearch damped Newton method for computing general equilibria, A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium, Differential evolution particle swarm optimization algorithm based on good point set for computing Nash equilibrium of finite noncooperative game, Buying optimal payoffs in bi-matrix games, Computation of sparse and dense equilibrium strategies of evolutionary games, ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria, Automatic verification of concurrent stochastic systems, A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities, Variational Inequality and Complementarity Problem, AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents, A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games, An approximate lower order penalty approach for solving second-order cone linear complementarity problems, ReGale: some memorable results, A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games, Successful Nash equilibrium agent for a three-player imperfect-information game, Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals, Nondominated Nash points: application of biobjective mixed integer programming, A new method for mean-variance portfolio optimization with cardinality constraints, Computing pure Nash equilibria in network revenue management games, Computing equilibria for integer programming games, A smooth system of equations approach to complementarity problems for frictionless contacts, Affective empathy in non-cooperative games, The Exact Computational Complexity of Evolutionarily Stable Strategies, Belief-invariant and quantum equilibria in games of incomplete information, Market equilibrium under piecewise Leontief concave utilities, Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium, Random bimatrix games are asymptotically easy to solve (a simple proof), On the multiplicity of solutions in generation capacity investment models with incomplete markets: a risk-averse stochastic equilibrium approach, Finite uniform approximation of two-person games defined on a product of staircase-function infinite spaces, Complementarity in Oriented Matroids, A note on anti-Nash equilibrium for bimatrix game, Representations and solutions for game-theoretic problems, Computational economics and economic theory: Substitutes or complements?, EP theorems and linear complementarity problems, A global Newton method to compute Nash equilibria., Using vector divisions in solving the linear complementarity problem, Completely mixed strategies for generalized bimatrix and switching controller stochastic game, Uniqueness of stationary equilibrium payoffs in coalitional bargaining, Colorful linear programming, Nash equilibrium, and pivots, Understanding PPA-completeness, Solving Chance-Constrained Games Using Complementarity Problems, On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method, General equilibrium models and homotopy methods, 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, Power Law Public Goods Game for Personal Information Sharing in News Commentaries, A core-allocation family for generalized holding cost games, Equivalence of vertical block linear complementarity problems and multi-objective programming problems, Tolerance approach to sensitivity analysis in quadratic programming problems., Multiparametric analysis of the maximum tolerance in quadratic programming problems., Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling, Variational inequality formulation for the games with random payoffs, A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence, PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY, Geometrie und Kombinatorik von Nash-Gleichgewichten., Unnamed Item, Unnamed Item, Unnamed Item, Robust game theory, Nash equilibria via duality and homological selection, An exposition of the (linear) complementarity problem, Heuristic algorithms for the cardinality constrained efficient frontier, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Parallel pivotal algorithm for solving the linear complementarity problem, A procedure for finding Nash equilibria in bi-matrix games, Tensor complementarity problems. III: Applications, Limited-trust equilibria, Approximate solution of the inverse Richards' problem, Unnamed Item, A simplex-type algorithm for continuous linear programs with constant coefficients, Partially observable game-theoretic agent programming in Golog, Complementary pivot theory of mathematical programming, The structure of the set of equilibria for two person multicriteria games., MASAGE: model-agnostic sequential and adaptive game estimation, Deciding probabilistic bisimilarity distance one for probabilistic automata, A generalization of the Nash equilibrium theorem on bimatrix games, Finding mixed strategies with small supports in extensive form games, The generalized linear complementarity problem revisited, A combinatorial approach to convex quadratic programming, An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems, Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions, A finite improvement algorithm for the linear complementarity problem, On the number of solutions to the complementarity problem and spanning properties of complementary cones, Algorithms for discounted stochastic games, A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Game logic and its applications. I, Generalized linear complementarity in a problem of \(n\)-person games, On the formulation and implementation of extrinsic cohesive zone models with contact, Fast modulus-based matrix splitting iteration methods for implicit complementarity problems, COMPUTATION OF COMPLETELY MIXED EQUILIBRIUM PAYOFFS IN BIMATRIX GAMES, Computation of all solutions to a system of polynomial equations, Oriented Euler complexes and signed perfect matchings, Piecewise linear methods for nonlinear equations and optimization, A game theoretic model of the behavioural gaming that takes place at the EMS-ED interface, Polynomial-time computation of exact correlated equilibrium in compact games, Complementarity problems in GAMS and the PATH solver, Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria, Two-player simultaneous location game: preferential rights and overbidding, Game Theory Explorer: software for the applied game theorist