Bimatrix Equilibrium Points and Mathematical Programming
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Vector F-implicit complementarity problems with corresponding variational inequality problems
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- New characterizations of row sufficient matrices
- Mixed quasi complementarity problems in topological vector spaces
- 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
- 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)
- Total dual integrality of the linear complementarity problem
- Capacity-constrained multiple-market price discrimination
- 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
- 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
- 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
- Vector mixed quasi complementarity problems in Banach spaces
- Equilibrium solutions in multiobjective bimatrix games with fuzzy payoffs and fuzzy goals
- A modified alternating direction method for convex minimization problems
This page was built for publication: Bimatrix Equilibrium Points and Mathematical Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514161)