Two-person nonzero-sum games and quadratic programming
From MaRDI portal
Publication:2394092
DOI10.1016/0022-247X(64)90021-6zbMATH Open0126.36505OpenAlexW2039355449MaRDI QIDQ2394092FDOQ2394092
Authors: Henry Stone, O. L. Mangasarian 
Publication date: 1964
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(64)90021-6
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
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Title not available (Why is that?)
- Non-cooperative games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi-Concave Programming
- An iterative method of solving a game
- Equivalence in nonlinear programming
- Title not available (Why is that?)
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Fictitious play for continuous games
Cited In (78)
- Title not available (Why is that?)
- Generalized multilinear games and vertical tensor complementarity problems
- A Glimpse at Paul G. Spirakis
- Title not available (Why is that?)
- Optimal Off-line Experimentation for Games
- Fast Algorithms for Rank-1 Bimatrix Games
- Vector valued nonzero sum games and nonlinear programming.
- A Note on Linear Complementarity via Two-Person Zero-Sum Games
- On some numerical methods of solving minmax problems
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- On-policy concurrent reinforcement learning
- A Characterization of Stationary Nash Equilibria of Single Controller Constrained Stochastic Games
- Modified difference-index based ranking bilinear programming approach to solving bimatrix games with payoffs of trapezoidal intuitionistic fuzzy numbers
- Model development with Maple in PhD-level management science courses: a personal account
- Title not available (Why is that?)
- A global optimization algorithm for solving a four-person game
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Credibilistic extensive game with fuzzy payoffs
- Equilibrium solutions in multiobjective bimatrix games with fuzzy payoffs and fuzzy goals
- Computer experiments on quadratic programming algorithms
- Two-person non-zero-sum games as multicriteria goal games
- Quadratic programming and the single-controller stochastic game
- General-sum stochastic games: verifiability conditions for Nash equilibria
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- Entropic regularization in hierarchical games
- Residual and quasisolution methods with an extended set for searching for Nash equilibrium points in a bilinear two-person game with nonzero sum
- Stabilization method with a set extension for searching for Nash equilibrium points in a bilinear nonzero-sum two-person game
- A second-order cone programming formulation for two player zero-sum games with chance constraints
- A note on determining pure-strategy equilibrium points of bimatrix games
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- Nonlinear programming and stationary equilibria in stochastic games
- On mutual concavity and strategically-zero-sum bimatrix games
- Solving bimatrix games with fuzzy payoffs by introducing Nature as a third player
- A computational method for solving \(n\)-person game
- Constrained games as complementary eigenvalue problems
- Extra-proximal methods for solving two-person nonzero-sum games
- Convergent Generalized Monotone Splitting of Matrices
- Competition with list prices
- Jointly constrained bilinear programs and related problems: An overview
- Multi-objective fuzzy bi-matrix game model: a multicriteria non-linear programming approach
- A cutting plane algorithm for solving bilinear programs
- On a game in manufacturing
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- Bi-matrix games with fuzzy goals and fuzzy
- Symmetric duality in quadratic programming and matrix game equivalence.
- Multiagent learning using a variable learning rate
- Polymatrix games and optimization problems
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem
- PQ oligopoly, proportional rationing, and randomly ordered consumers
- Solving fuzzy matrix games through a ranking value function method
- A characterization of Nash equilibrium for the games with random payoffs
- An Inverse-Function Theorem for a Class of Multivalued Functions
- Discounted Semi-Markov Games and Algorithms for Solving Two Structured Classes
- Title not available (Why is that?)
- Solving two-person nonzero-sum games with the help of differential equations
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game and corresponding mathematical programming problem
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Constrained nonzero-sum games with partially controllable strategies
- A game theoretic framework for software diversity for network security
- A note on the solution of bilinear programming problems by reduction to concave minimization
- Duality Theorems and Theorems of the Alternative
- Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium
- A Nonlinear Programming Approach to Determine a Generalized Equilibrium for N-Person Normal Form Games
- Uniqueness of equilibrium points in bimatrix games
- A robust optimization approach for solving two-person games under interval uncertainty
- On solving a non-convex quadratic programming problem involving resistance distances in graphs
- Solubility condition for a linear-quadratic game
- Computation of sparse and dense equilibrium strategies of evolutionary games
- A method for constructing the local points of the Nash equilibrium in a linear game problem
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- A note on bimatrix game maximal Selten subsets
- An equivalent mathematical program for games with random constraints
- Characterization of the equilibrium strategy of the bimatrix game with fuzzy payoff
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
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)
