Two-person nonzero-sum games and quadratic programming
From MaRDI portal
Publication:2394092
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
- 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?)
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- An iterative method of solving a game
- Equivalence in nonlinear programming
- Fictitious play for continuous games
- Non-cooperative games
- Quasi-Concave Programming
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Cited in
(84)- Global optimization approach to nonzero sum n person game
- A characterization of stationary Nash equilibria of single controller constrained stochastic games
- Credibilistic extensive game with fuzzy payoffs
- Computer experiments on quadratic programming algorithms
- Equilibrium solutions in multiobjective bimatrix games with fuzzy payoffs and fuzzy goals
- scientific article; zbMATH DE number 7559094 (Why is no real title available?)
- Two-person non-zero-sum games as multicriteria goal games
- Semidefinite Relaxation Methods for Tensor Absolute Value Equations
- Quadratic programming and the single-controller stochastic game
- General-sum stochastic games: verifiability conditions for Nash equilibria
- A note on ``A methodology for solving bimatrix games under 2-tuple linguistic environment
- 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
- Generalized multilinear games and vertical tensor complementarity problems
- A second-order cone programming formulation for two player zero-sum games with chance constraints
- 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 note on determining pure-strategy equilibrium points of bimatrix games
- Nonlinear programming and stationary equilibria in stochastic games
- On mutual concavity and strategically-zero-sum bimatrix games
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- Solving bimatrix games with fuzzy payoffs by introducing Nature as a third player
- scientific article; zbMATH DE number 3882234 (Why is no real title available?)
- A computational method for solving \(n\)-person game
- Calculating Nash equilibrium on quantum annealers
- Constrained games as complementary eigenvalue problems
- Extra-proximal methods for solving two-person nonzero-sum games
- Optimal Off-line Experimentation for Games
- Fast Algorithms for Rank-1 Bimatrix Games
- Convergent Generalized Monotone Splitting of Matrices
- Vector valued nonzero sum games and nonlinear programming.
- Jointly constrained bilinear programs and related problems: An overview
- Competition with list prices
- On a game in manufacturing
- Multi-objective fuzzy bi-matrix game model: a multicriteria non-linear programming approach
- Recent advances in minimax problem and bimatrix games
- A cutting plane algorithm for solving bilinear programs
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- A Note on Linear Complementarity via Two-Person Zero-Sum Games
- Bi-matrix games with fuzzy goals and fuzzy
- Symmetric duality in quadratic programming and matrix game equivalence.
- Polymatrix games and optimization problems
- Multiagent learning using a variable learning rate
- PQ oligopoly, proportional rationing, and randomly ordered consumers
- On some numerical methods of solving minmax problems
- A characterization of Nash equilibrium for the games with random payoffs
- Solving fuzzy matrix games through a ranking value function method
- An Inverse-Function Theorem for a Class of Multivalued Functions
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- On-policy concurrent reinforcement learning
- Solving two-person nonzero-sum games with the help of differential equations
- scientific article; zbMATH DE number 4049433 (Why is no real title available?)
- 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
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Constrained nonzero-sum games with partially controllable strategies
- The error bounds of linear and tensor complementarity problems
- A note on the solution of bilinear programming problems by reduction to concave minimization
- A game theoretic framework for software diversity for network security
- Distributionally robust chance-constrained games: existence and characterization of Nash equilibrium
- Duality Theorems and Theorems of the Alternative
- Modified difference-index based ranking bilinear programming approach to solving bimatrix games with payoffs of trapezoidal intuitionistic fuzzy numbers
- 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
- Model development with Maple in PhD-level management science courses: a personal account
- The study of the set of Nash equilibrium points for one two-players game with quadratic payoff functions
- A glimpse at Paul G. Spirakis
- 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
- scientific article; zbMATH DE number 3995479 (Why is no real title available?)
- Discounted semi-Markov games and algorithms for solving two structured classes
- A note on bimatrix game maximal Selten subsets
- An equivalent mathematical program for games with random constraints
- A global optimization algorithm for solving a four-person game
- Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem
- Characterization of the equilibrium strategy of the bimatrix game with fuzzy payoff
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
- 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)
