Bimatrix Equilibrium Points and Mathematical Programming

DOI10.1287/mnsc.11.7.681zbMath0139.13103WikidataQ110904714 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

Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids, The valuation of foreign currency options under stochastic interest rates, 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, Systems of linear interval equations, Variational inequalities and the pricing of American options, The principal pivoting method revisited, Linear quadratic programming in oriented matroids, 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, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, A hybrid support vector machines and logistic regression approach for forecasting intermittent demand of spare parts, Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games, Exponential lower bounds for finding Brouwer fixed points, Iterative algorithms for semi-linear quasi-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, Exchange price equilibria and variational inequalities, On the gradient-projection method for solving the nonsymmetric linear complementarity problem, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem, A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices, 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, Evolution, games theory and polyhedra, The quasi-complementarity problem, 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, Emerging paradigms in applied mathematical modelling - an introduction, 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, An existence result on noncoercive hemivariational inequalities, Q-matrices and spherical geometry, Observations on a class of nasty linear complementarity problems, A cutting-plane algorithm with linear and geometric rates of convergence, On the resolution of some unilaterally constrained problems in structural engineering, 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, On diagonal dominance in linear complementarity, 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\), Parametric simplex algorithms for solving a special class of nonconvex minimization problems, Copositive-plus Lemke algorithm solves polymatrix games, 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, A new polynomial time method for a linear complementarity problem, A unified approach to complementarity in optimization, Extensions of Lemke's algorithm for the linear complementarity problem, On the simplex method and a class of linear complementarity problems, Cubical Sperner lemmas as applications of generalized complementary pivoting, A reduction theorem for the linear complementarity problem with a certain patterned matrix, The linear complementarity problem, sufficient matrices, and the criss- cross method, Linearly constrained estimation by mathematical programming, General economic equilibrium and variational inequalities: Existence, uniqueness and sensitivity, 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, On the complexity of the parity argument and other inefficient proofs of existence, Generalized strongly nonlinear quasi-complementarity problems, A new method for a class of linear variational inequalities, The simplex algorithm with a new primal and dual pivot rule, The convergence of parallel iteration algorithms for linear complementarity problems, A note on determining pure-strategy equilibrium points of bimatrix games, Solvability theory for a class of hemivariational inequalities involving copositive plus matrices. Applications in robotics, 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, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, On the connectedness of solution sets in linear complementarity problems, Fixed-point technique for implicit complementarity problem in Hilbert lattice, Representations and solutions for game-theoretic problems, EP theorems and linear complementarity problems, A global Newton method to compute Nash equilibria., Solving a class of asymmetric variational inequalities by a new alternating direction method, Piecewise linear methods for nonlinear equations and optimization, The generalized linear complementarity problem and an algorithm to find all its solutions, The basic theorem of complementarity revisited, On strongly degenerate complementary cones and solution rays, A generalization of the Nash equilibrium theorem on bimatrix games, The generalized linear complementarity problem revisited, On the one-dimensional nonlinear elastohydrodynamic lubrication, Some generalizations of the criss-cross method for quadratic programming, The general quadratic optimization problem, Homotopies for computation of fixed points, 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, Postoptimality Analysis of Quadratic Programs, Generic properties of the complementarity problem, A generalized complementary pivoting algorithm, Reducing the Maximum Risk of Regression Estimators by Polyhedral Projection, Stability of the linear complementarity problem at a solution point, The complementarity problem, On the basic theorem of complementarity, Monotone solutions of the parametric linear complementarity problem, Hybrid programs: Linear and least-distance, A comparison of the primal‐simplex and complementary pivot methods for linear programming, Homotopies for computation of fixed points on unbounded regions, An Odd Theorem, 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, \(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, On the use of boundary conditions for variational formulations arising in financial mathematics., Existence theory and \(Q\)-matrix characterization for the generalized linear complementarity problem, Multiple-objective approximation of feasible but unsolvable linear complementarity problems, Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals, Criteria for sufficient matrices, A comparison of minimax and least squares estimators in linear regression with polyhedral prior information, Equilibrium solutions in multiobjective bimatrix games with fuzzy payoffs and fuzzy goals, A modified alternating direction method for convex minimization problems, On copositive matrices with -1, 9, 1 entries, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Parallel pivotal algorithm for solving the linear complementarity problem, The coming of game theory, Sufficient matrices belong to \(L\)., A class of polynomially solvable linear complementarity problems, Dynamic nonlinear modelization of operational supply chain systems, A variable-grouping based genetic algorithm for large-scale integer programming, Complementary pivot theory of mathematical programming, 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, Existence theory for generalized nonlinear complementarity problems, On the number of solutions to the complementarity problem and spanning properties of complementary cones, 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, Complementarity problems in semi-inner product spaces, PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY, Unnamed Item, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, An application of homotopy to solving linear programs, An exposition of the (linear) complementarity problem, A note onQ-matrices, Complementarity in Oriented Matroids, Newton's method for linear complementarity problems, A theorem Onp-matrices, Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's, On the uniqueness of solutions to linear complementarity problems, Even more with the Lemke complementarity algorithm, Linear complementarity problems with an invariant number of solutions, Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm, A POINT BASIS FOR MULTIVARIABLE PIECEWISE LINEAR INTERPOLATION AND DESIGN CENTERING, Robustness and nondegenerateness for linear complementarity problems, A finite characterization ofK-matrices in dimensions less than four, Iterative algorithms for the linear complementarity problem, A Stochastic Generalized Network Model and Large-Scale Mean-Variance Algorithm for Portfolio Selection, Computational complexity of LCPs associated with positive definite symmetric matrices, A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization, A variable dimension algorithm for the linear complementarity problem, Completely- matrices, A unification of two classes ofQ-matrices, Unnamed Item, A Polynomial Method of Weighted Centers for Convex Quadratic Programming, Algorithms for stochastic games ? A survey, A set intersection theorem and applications, Coalition behaviour in n‐person conflicts†, A fixed point theorem including the last theorem of Poincaré, On the number of solutions to the linear comple-mentarity problem, A unification of the existence theorems of the nonlinear complementarity problem, A game theoretic approach to a two firm bidding problem, A simplicial approximation of a solution for the nonlinear complementarity problem, Large-scale linearly constrained optimization, Cycling in linear complementarity problems, 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, Finding all solutions to polynomial systems and other systems of equations, The effectiveness of finite improvement algorithms for finding global optima