Equilibrium Points of Bimatrix Games

Cited in

(only showing first 100 items - show all)

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
Perspectives on multiagent learning
On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games
Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
A parametric approach to complementarity theory
Layout of facilities with some fixed points
Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
Constructing bimatrix games with unique equilibrium points
A constructive proof of a permutation-based generalization of Sperner's lemma
A bounded-rationality approach to the study of noncooperative games
On equilibria in finite games
Application of primitive sets to multi-criteria optimization problems
On the Knaster-Kuratowski-Mazurkiewicz-Shapley theorem
Nonlinear programming and stationary equilibria in stochastic games
Implementing the modified LH algorithm
Copositive-plus Lemke algorithm solves polymatrix games
Generalized bilinear programming. I: Models, applications and linear programming relaxation
A unified approach to complementarity in optimization
Sandwich method for finding fixed points
On the simplex method and a class of linear complementarity problems
Existence of equilibrium pairs in continuous games
On the solution of large, structured linear complementarity problems: The tridiagonal case
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
Equilibrium points in special n-person games
The transition from a Drèze equilibrium to a Walrasian equilibrium
Cost allocation in the Chinese postman problem
Degeneracy in linear complementarity problems: A survey
Tolerance approach to sensitivity analysis in linear complementarity problems
On the complexity of the parity argument and other inefficient proofs of existence
A new method for a class of linear variational inequalities
A note on determining pure-strategy equilibrium points of bimatrix games
Equilibrium adjustment of disequilibrium prices
A theorem on the number of Nash equilibria in a bimatrix game
Criss-cross methods: A fresh view on pivot algorithms
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.
On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method
Piecewise linear methods for nonlinear equations and optimization
Complementarity problems in GAMS and the PATH solver
A novel game theoretic approach for modeling competitive information diffusion in social networks with heterogeneous nodes
Buying optimal payoffs in bi-matrix games
Computation of sparse and dense equilibrium strategies of evolutionary games
Successful Nash equilibrium agent for a three-player imperfect-information game
Nondominated Nash points: application of biobjective mixed integer programming
Computing pure Nash equilibria in network revenue management games
A smooth system of equations approach to complementarity problems for frictionless contacts
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
Completely mixed strategies for generalized bimatrix and switching controller stochastic game
Colorful linear programming, Nash equilibrium, and pivots
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
Variational inequality formulation for the games with random payoffs
The structure of the set of equilibria for two person multicriteria games.
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 finite improvement algorithm for the linear complementarity problem
Equilibrium solutions for multiobjective bimatrix games incorporating fuzzy goals
General equilibrium models and homotopy methods
Nash equilibria via duality and homological selection
Limited-trust equilibria
MASAGE: model-agnostic sequential and adaptive game estimation
An inexact alternating direction method of multipliers for a kind of nonlinear complementarity problems
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
On the formulation and implementation of extrinsic cohesive zone models with contact
Fast modulus-based matrix splitting iteration methods for implicit complementarity problems
A game theoretic model of the behavioural gaming that takes place at the EMS-ED interface
Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
Differential evolution particle swarm optimization algorithm based on good point set for computing Nash equilibrium of finite noncooperative game
Automatic verification of concurrent stochastic systems
An approximate lower order penalty approach for solving second-order cone linear complementarity problems
A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
Computing equilibria for integer programming games
Affective empathy in non-cooperative games
Understanding PPA-completeness
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
Tensor complementarity problems. III: Applications
Approximate solution of the inverse Richards' problem
A simplex-type algorithm for continuous linear programs with constant coefficients
Partially observable game-theoretic agent programming in Golog
Deciding probabilistic bisimilarity distance one for probabilistic automata
Oriented Euler complexes and signed perfect matchings
Polynomial-time computation of exact correlated equilibrium in compact games
Two-player simultaneous location game: preferential rights and overbidding
Game Theory Explorer: software for the applied game theorist
A pathsearch damped Newton method for computing general equilibria
AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
ReGale: some memorable results
A new method for mean-variance portfolio optimization with cardinality constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5335815)