Bimatrix Equilibrium Points and Mathematical Programming

DOI10.1287/mnsc.11.7.681zbMath0139.13103OpenAlexW2152122625WikidataQ110904714 ScholiaQ110904714MaRDI QIDQ5514161

C. E. Lemke

Publication date: 1965

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.11.7.681

zbMATH Keywords

operations research

Related Items

LQP method with a new optimal step size rule for nonlinear complementarity problems, A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices, Improved convergence theorems of multisplitting methods for the linear complementarity problem, On Lemke processibility of LCP formulations for solving discounted switching control stochastic games, New trends in general variational inequalities, Existence of solutions for extended generalized complementarity problems, Convergence of SSOR methods for linear complementarity problems, The linear complementarity problem and a subclass of fully semimonotone matrices, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, Algorithm for cardinality-constrained quadratic optimization, Evolution, games theory and polyhedra, Computing a quasi-perfect equilibrium of a two-player game, Homotopy methods to compute equilibria in game theory, Equilibrium tracing in strategic-form games, Deception in sender-receiver games, On discounted AR-AT semi-Markov games and its complementarity formulations, The quasi-complementarity problem, A hybrid support vector machines and logistic regression approach for forecasting intermittent demand of spare parts, Iterative methods for a class of complementarity problems, Fixed point approach for complementarity problems, An algorithm for the linear complementarity problem with upper and lower bounds, On a quadratic programming problem involving distances in trees, Emerging paradigms in applied mathematical modelling - an introduction, Some LCPs solvable in strongly polynomial time with Lemke's algorithm, Existence results for vector mixed quasi-complementarity problems, Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games, The valuation of foreign currency options under stochastic interest rates, A new continuation method for complementarity problems with uniform P- functions, An extension of Karmarkar's projective algorithm for convex quadratic programming, Sufficient matrices and the linear complementarity problem, A polynomial-time algorithm for a class of linear complementarity problems, Combinatorial characterizations of \(K\)-matrices, An existence result on noncoercive hemivariational inequalities, Q-matrices and spherical geometry, Solving subclasses of multi-player stochastic games via linear complementarity problem formulations -- a survey and some new results, An artificial boundary method for the Hull-White model of American interest rate derivatives, Observations on a class of nasty linear complementarity problems, A cutting-plane algorithm with linear and geometric rates of convergence, A generalized Newton method of high-order convergence for solving the large-scale linear complementarity problem, On the resolution of some unilaterally constrained problems in structural engineering, IGAOR and multisplitting IGAOR methods for linear complementarity problems, Optimum design of plastic structures under displacement constraints, A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, Computer experiments on quadratic programming algorithms, Matrices and the linear complementarity problem, On the parametric linear complementarity problem: A generalized solution procedure, An algorithm for determining copositive matrices, On diagonal dominance in linear complementarity, Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints, Exponential lower bounds for finding Brouwer fixed points, Iterative algorithms for semi-linear quasi-complementarity problems, Generalized AOR method for solving absolute complementarity problems, Lemke's method - a recursive approach, \(\tilde K'_ 3\)- A new triangulation of \(R^ n\), Jointly constrained bilinear programs and related problems: An overview, On perfect Nash equilibria of polymatrix games, Exchange price equilibria and variational inequalities, Games in oriented matroids, Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets, On linear fractional programming problem and its computation using a neural network model, Sign-solvable linear complementarity problems, Simple search methods for finding a Nash equilibrium, Enumeration of PLCP-orientations of the 4-cube, The principle of extrapolation and the Cayley transform, Completely mixed strategies for two structured classes of semi-Markov games, principal pivot transform and its generalizations, Generalized vector implicit complementarity problems with corresponding variational inequality problems, Computing Nash equilibria by iterated polymatrix approximation, Contact-aware simulations of particulate Stokesian suspensions, Issues in computing contact forces for non-penetrating rigid bodies, Exterior point algorithms for nearest points and convex quadratic programs, Open questions in complexity theory for numerical optimization, Linear complementarity problems and multiple objective programming, The nearest point problem in a polyhedral set and its extensions, Generalized vector implicit quasi complementarity problems, A field guide to the matrix classes found in the literature of the linear complementarity problem, Monotone and maximal monotone affine subspaces, An active index algorithm for the nearest point problem in a polyhedral cone, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, Generalized vector complementarity-type problems in topological vector spaces, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix, Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, Imitation games and computation, Crack propagation due to time-dependent creep in quasi-brittle materials under sustained loading, An iterative method for a system of linear complementarity problems with perturbations and interval data, Vector \(F\)-implicit complementarity problems with corresponding variational inequality problems, Polynomial algorithms for approximating Nash equilibria of bimatrix games, Systems of linear interval equations, Variational inequalities and the pricing of American options, Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem, New characterizations of row sufficient matrices, The principal pivoting method revisited, Linear quadratic programming in oriented matroids, Mixed quasi complementarity problems in topological vector spaces, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, A fixed-point representation of the generalized complementarity problem, Stable monotone variational inequalities, Interior-point algorithms for global optimization, On total functions, existence theorems and computational complexity, 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, On the complexity of the parity argument and other inefficient proofs of existence, Generalized strongly nonlinear quasi-complementarity problems, Some new classes of general quasi variational inequalities, A new method for a class of linear variational inequalities, On the convergence of two-step modulus-based matrix splitting iteration method, The simplex algorithm with a new primal and dual pivot rule, Novel algorithms for solving a system of absolute value variational inequalities, Computational complexity of computing a quasi-proper equilibrium, Dynamic penalty function method for the side constrained traffic assignment problem, Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem, The convergence of parallel iteration algorithms for linear complementarity problems, A note on determining pure-strategy equilibrium points of bimatrix games, An approximate lower order penalty approach for solving second-order cone linear complementarity problems, Multiple-objective approximation of feasible but unsolvable linear complementarity problems, Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals, Solvability theory for a class of hemivariational inequalities involving copositive plus matrices. Applications in robotics, Criteria for sufficient matrices, Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule, New models for a class of adhesive grippers. The hemivariational inequality approach, Solvability theory and projection methods for a class of singular variational inequalities: Elastostatic unilateral contact applications, A comparison of minimax and least squares estimators in linear regression with polyhedral prior information, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, The reduced order method for solving the linear complementarity problem with an \(M\)-matrix, On the connectedness of solution sets in linear complementarity problems, Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem, Fixed-point technique for implicit complementarity problem in Hilbert lattice, Parameterized complexity of sparse linear complementarity problems, On solving a non-convex quadratic programming problem involving resistance distances in graphs, Generalized vector complementarity problem with fuzzy mappings, An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs, Random bimatrix games are asymptotically easy to solve (a simple proof), The problem of projecting the origin of Euclidean space onto the convex polyhedron, A structure-preserving pivotal method for affine variational inequalities, Vector mixed quasi complementarity problems in Banach spaces, Representations and solutions for game-theoretic problems, EP theorems and linear complementarity problems, A global Newton method to compute Nash equilibria., Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras, Unique end of potential line, Computing integral solutions of complementarity problems, Using vector divisions in solving the linear complementarity problem, Orderfield property of mixtures of stochastic games, Uniqueness of stationary equilibrium payoffs in coalitional bargaining, On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method, Implementing the modified LH algorithm, Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\), Equilibrium solutions in multiobjective bimatrix games with fuzzy payoffs and fuzzy goals, Total dual integrality of the linear complementarity problem, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Copositive-plus Lemke algorithm solves polymatrix games, A modified alternating direction method for convex minimization problems, An \(O(n^ 3L)\) adaptive path following algorithm for a linear complementarity problem, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, Two characterizations of sufficient matrices, A mixed formulation for frictional contact problems prone to Newton like solution methods, On the use of the ranking function approach to solve fuzzy matrix games in a direct way, Generalized bilinear programming. I: Models, applications and linear programming relaxation, An RLT approach for solving the binary-constrained mixed linear complementarity problem, A new polynomial time method for a linear complementarity problem, The modulus-based matrix double splitting iteration method for linear complementarity problems, Capacity-constrained multiple-market price discrimination, A unified approach to complementarity in optimization, On copositive matrices with -1, 9, 1 entries, Extensions of Lemke's algorithm for the linear complementarity problem, On the simplex method and a class of linear complementarity problems, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Parallel pivotal algorithm for solving the linear complementarity problem, Tensor complementarity problems. III: Applications, Limited-trust equilibria, Equilibrium strategies for multiple interdictors on a common network, Cubical Sperner lemmas as applications of generalized complementary pivoting, A reduction theorem for the linear complementarity problem with a certain patterned matrix, Generalized vector complementarity problem in fuzzy environment, The generalized linear complementarity problem and an algorithm to find all its solutions, The basic theorem of complementarity revisited, Convergence of some iterative algorithms for system of generalized set-valued variational inequalities, A simplex-type algorithm for continuous linear programs with constant coefficients, The linear complementarity problem, sufficient matrices, and the criss- cross method, Linearly constrained estimation by mathematical programming, On strongly degenerate complementary cones and solution rays, A generalization of the Nash equilibrium theorem on bimatrix games, The generalized linear complementarity problem revisited, \(P_ c\)-matrices and the linear complementarity problem, A finite improvement algorithm for the linear complementarity problem, Complementarity problems for multivalued monotone operator in Banach spaces, Oriented Euler complexes and signed perfect matchings, Solving a class of asymmetric variational inequalities by a new alternating direction method, Piecewise linear methods for nonlinear equations and optimization, General economic equilibrium and variational inequalities: Existence, uniqueness and sensitivity, On the use of boundary conditions for variational formulations arising in financial mathematics., Degeneracy in linear complementarity problems: A survey, Pivot rules for linear programming: A survey on recent theoretical developments, Some aspects of variational inequalities, Linear complementarity and discounted switching controller stochastic games, Tolerance approach to sensitivity analysis in linear complementarity problems, Continuous linear complementarity problem, Gauss-Newton methods for the complementarity problem, On the solvability of noncoercive linear variational inequalities in separable Hilbert spaces, A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point, Game Theory Explorer: software for the applied game theorist, Perspective Reformulation and Applications, A Polynomial Method of Weighted Centers for Convex Quadratic Programming, Even more with the Lemke complementarity algorithm, Algorithms for stochastic games ? A survey, Complementarity problems in semi-inner product spaces, A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities, Variational Inequality and Complementarity Problem, Polyhedral Complementarity on a Simplex. Potentiality of Regular Mappings, Constant Rank Two-Player Games are PPAD-hard, The Linear Complementarity Problems with a Few Variables per Constraint, Discounted Semi-Markov Games and Algorithms for Solving Two Structured Classes, Linear complementarity problems with an invariant number of solutions, A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps, A note onQ-matrices, Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm, On the basic theorem of complementarity, Two-Step Two-Sweep Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems, A POINT BASIS FOR MULTIVARIABLE PIECEWISE LINEAR INTERPOLATION AND DESIGN CENTERING, Complementarity in Oriented Matroids, Robustness and nondegenerateness for linear complementarity problems, A Simple P-Matrix Linear Complementarity Problem for Discounted Games, On the one-dimensional nonlinear elastohydrodynamic lubrication, Some generalizations of the criss-cross method for quadratic programming, Monotone solutions of the parametric linear complementarity problem, Hybrid programs: Linear and least-distance, A finite characterization ofK-matrices in dimensions less than four, A set intersection theorem and applications, Reducing the Maximum Risk of Regression Estimators by Polyhedral Projection, On generalizations of positive subdefinite matrices and the linear complementarity problem, Solving Chance-Constrained Games Using Complementarity Problems, A Friendly Smoothed Analysis of the Simplex Method, An Odd Theorem, Iterative algorithms for the linear complementarity problem, GENERALIZED MIXED QUASI-COMPLEMENTARITY PROBLEMS IN TOPOLOGICAL VECTOR SPACES, Coalition behaviour in n‐person conflicts†, A Stochastic Generalized Network Model and Large-Scale Mean-Variance Algorithm for Portfolio Selection, A point-of-attraction result for Newton's method with point-based approximations, An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems, ON FULLY SEMIMONOTONE MATRICES, Equivalence of vertical block linear complementarity problems and multi-objective programming problems, A fixed point theorem including the last theorem of Poincaré, Newton's method for linear complementarity problems, A new variable reduction technique for convex integer quadratic programs, Considering contact conditions between discontinuity surfaces in extended finite element method (XFEM), On the number of solutions to the linear comple-mentarity problem, An experimental study of a DC optimization algorithm for bimatrix games, Minimum norm solution to the positive semidefinite linear complementarity problem, Algorithmic copositivity detection by simplicial partition, A unification of the existence theorems of the nonlinear complementarity problem, A game theoretic approach to a two firm bidding problem, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, The coming of game theory, A simplicial approximation of a solution for the nonlinear complementarity problem, Sufficient matrices belong to \(L\)., PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY, The general quadratic optimization problem, Homotopies for computation of fixed points, An application of homotopy to solving linear programs, A class of polynomially solvable linear complementarity problems, Computational complexity of LCPs associated with positive definite symmetric matrices, Dynamic nonlinear modelization of operational supply chain systems, Stability of the linear complementarity problem at a solution point, An exposition of the (linear) complementarity problem, A theorem Onp-matrices, A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization, A representation of the solution set of a class of linear complementarity problems, On Solving Mean Payoff Games Using Pivoting Algorithms, Large-scale linearly constrained optimization, A variable-grouping based genetic algorithm for large-scale integer programming, POST-BUCKLING ANALYSIS WITH FRICTIONAL CONTACTS COMBINING COMPLEMENTARITY RELATIONS AND AN ARC-LENGTH METHOD, A variable dimension algorithm for the linear complementarity problem, Completely- matrices, Cycling in linear complementarity problems, Complementary pivot theory of mathematical programming, An algorithm for the linear complementarity problem, On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation, Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm, The nonlinear complementarity problem, with applications. I, On classes of copositive matrices, A combinatorial approach to convex quadratic programming, Boundedness relations for linear constraint sets, Unique End of Potential Line, Existence theory for generalized nonlinear complementarity problems, Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems, An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example, Finding all solutions to polynomial systems and other systems of equations, The effectiveness of finite improvement algorithms for finding global optima, On the number of solutions to the complementarity problem and spanning properties of complementary cones, Generalized symmetric accelerated over relaxation method for solving absolute value complementarity problems, A unification of two classes ofQ-matrices, Fast Algorithms for Rank-1 Bimatrix Games, Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's, Solution of the complex linear complementarity problem, Generalized linear complementarity in a problem of \(n\)-person games, An approximate dynamic programming approach to convex quadratic knapsack problems, On the uniqueness of solutions to linear complementarity problems, Postoptimality Analysis of Quadratic Programs, Generic properties of the complementarity problem, Unnamed Item, A generalized complementary pivoting algorithm, The complementarity problem, Modulus-based matrix splitting methods for complex linear complementarity problem, Total negativity: characterizations and single-vector tests, Characterizing total positivity: Single vector tests via linear complementarity, sign non‐reversal and variation diminution, A sequential linear complementarity problem for multisurface plasticity, Generalized multilinear games and vertical tensor complementarity problems, A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems, A comparison of the primal‐simplex and complementary pivot methods for linear programming, Homotopies for computation of fixed points on unbounded regions, A new resolution method for the parametric linear complementarity problem, On degeneracy in linear complementarity problems, Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces, Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces, Generalized complementarity problems for fuzzy mappings, Generalized complementarity problems for fuzzy mappings, On degeneracy in linear complementarity problems, Solving large protein secondary structure classification problems by a nonlinear complementarity algorithm with {0, 1} variables