Two-person nonzero-sum games and quadratic programming

From authors' abstract: It is shown that a necessary and sufficient condition that a point be a Nash equilibrium point of a two-person nonzero-sum game with a finite number of pure strategies is that the point be a solution of a single programming problem with linear constraints and a quadratic objective function that has a global maximum of zero. Every equilibrium point is a solution of this programming problem.

Recommendations

Residual and quasisolution methods with an extended set for searching for Nash equilibrium points in a bilinear two-person game with nonzero sum
Quadratic programming and the single-controller stochastic game
Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem
A noncooperative game on polyhedral sets
The study of the set of Nash equilibrium points for one two-players game with quadratic payoff functions

Cites work

AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
An iterative method of solving a game
Equivalence in nonlinear programming
Fictitious play for continuous games
scientific article; zbMATH DE number 3137856 (Why is no real title available?)
scientific article; zbMATH DE number 3156832 (Why is no real title available?)
scientific article; zbMATH DE number 3175708 (Why is no real title available?)
scientific article; zbMATH DE number 3067835 (Why is no real title available?)
Non-cooperative games
Quasi-Concave Programming
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

Cited in

(85)

Extra-proximal methods for solving two-person nonzero-sum games
Solving two-person nonzero-sum games with the help of differential equations
Solving bimatrix games with fuzzy payoffs by introducing Nature as a third player
Quadratic programming and the single-controller stochastic game
A note on the solution of bilinear programming problems by reduction to concave minimization
Constrained games as complementary eigenvalue problems
Computer experiments on quadratic programming algorithms
Nonlinear programming and stationary equilibria in stochastic games
Generalized bilinear programming. I: Models, applications and linear programming relaxation
Uniqueness of equilibrium points in bimatrix games
Two-person non-zero-sum games as multicriteria goal games
A note on determining pure-strategy equilibrium points of bimatrix games
On a game in manufacturing
A method for constructing the local points of the Nash equilibrium in a linear game problem
Characterization of the equilibrium strategy of the bimatrix game with fuzzy payoff
Multiagent learning using a variable learning rate
Computation of sparse and dense equilibrium strategies of evolutionary games
Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium
A second-order cone programming formulation for two player zero-sum games with chance constraints
A characterization of Nash equilibrium for the games with random payoffs
Symmetric duality in quadratic programming and matrix game equivalence.
Bi-matrix games with fuzzy goals and fuzzy
Stabilization method with a set extension for searching for Nash equilibrium points in a bilinear nonzero-sum two-person game
Residual and quasisolution methods with an extended set for searching for Nash equilibrium points in a bilinear two-person game with nonzero sum
Credibilistic extensive game with fuzzy payoffs
Equilibrium solutions in multiobjective bimatrix games with fuzzy payoffs and fuzzy goals
A game theoretic framework for software diversity for network security
On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
Entropic regularization in hierarchical games
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
On solving a non-convex quadratic programming problem involving resistance distances in graphs
A robust optimization approach for solving two-person games under interval uncertainty
An equivalent mathematical program for games with random constraints
A note on bimatrix game maximal Selten subsets
Multi-objective fuzzy bi-matrix game model: a multicriteria non-linear programming approach
A computational method for solving \(n\)-person game
A global optimization algorithm for solving a four-person game
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem
Vector valued nonzero sum games and nonlinear programming.
Model development with Maple in PhD-level management science courses: a personal account
Global optimization approach to nonzero sum n person game
Modified difference-index based ranking bilinear programming approach to solving bimatrix games with payoffs of trapezoidal intuitionistic fuzzy numbers
PQ oligopoly, proportional rationing, and randomly ordered consumers
scientific article; zbMATH DE number 3882234 (Why is no real title available?)
A glimpse at Paul G. Spirakis
scientific article; zbMATH DE number 4049433 (Why is no real title available?)
Bounds on Positive Integral Solutions of Linear Diophantine Equations
An Inverse-Function Theorem for a Class of Multivalued Functions
A cutting plane algorithm for solving bilinear programs
On mutual concavity and strategically-zero-sum bimatrix games
Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
A Nonlinear Programming Approach to Determine a Generalized Equilibrium for N-Person Normal Form Games
Polymatrix games and optimization problems
On-policy concurrent reinforcement learning
scientific article; zbMATH DE number 3995479 (Why is no real title available?)
Duality Theorems and Theorems of the Alternative
Optimal Off-line Experimentation for Games
Fast Algorithms for Rank-1 Bimatrix Games
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
Discounted semi-Markov games and algorithms for solving two structured classes
Strategies for quantum races
A Global Optimization Approach to Nonzero Sum Six-Person Game
Solving fuzzy matrix games through a ranking value function method
Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
A characterization of stationary Nash equilibria of single controller constrained stochastic games
The study of the set of Nash equilibrium points for one two-players game with quadratic payoff functions
On some numerical methods of solving minmax problems
Convergent Generalized Monotone Splitting of Matrices
A Note on Linear Complementarity via Two-Person Zero-Sum Games
Semidefinite Relaxation Methods for Tensor Absolute Value Equations
Competition with list prices
The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
Generalized multilinear games and vertical tensor complementarity problems
LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
The error bounds of linear and tensor complementarity problems
General-sum stochastic games: verifiability conditions for Nash equilibria
A note on ``A methodology for solving bimatrix games under 2-tuple linguistic environment
Calculating Nash equilibrium on quantum annealers
Recent advances in minimax problem and bimatrix games
Constrained bi-matrix games with intuitionistic fuzzy goals
Constrained nonzero-sum games with partially controllable strategies
Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
Solubility condition for a linear-quadratic game
Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: Two-person nonzero-sum games and quadratic programming

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