Non-convexity in noncooperative game theory
From MaRDI portal
Publication:1124537
DOI10.1007/BF01254290zbMath0678.90101OpenAlexW1990887241MaRDI QIDQ1124537
Publication date: 1989
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01254290
Nash equilibriafirst-order necessary optimality conditionspolynomial utility functionspre-equilibrium set
Related Items (7)
A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games ⋮ Resolution of dilemmas: A mathematical theory ⋮ Polynomial programming using multi-homogeneous polynomial continuation ⋮ Multiple-objective programming with polynomial objectives and constraints ⋮ Linear complementarity problems and multiple objective programming ⋮ Existence of pure Nash equilibria in discontinuous and non quasiconcave games ⋮ Combinatorial optimization in Nash games
Uses Software
Cites Work
- A homotopy for solving polynomial systems
- Existence of solutions of games with some non-convexity
- On Nash equilibrium
- Algorithm 652
- On the Number of Solutions to Polynomial Systems of Equations
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Quasi-Equilibria in Markets with Non-Convex Preferences
- Equilibrium points in n -person games
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Non-convexity in noncooperative game theory