Combinatorial optimization in Nash games

DOI10.1016/0898-1221(93)90278-4zbMath0778.90092OpenAlexW2050703074MaRDI QIDQ1802492

Michael M. Kostreva

Publication date: 3 January 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90278-4

zbMATH Keywords

Nash equilibriapre-equilibrium setpolynomial system of equations

Mathematics Subject Classification ID

Noncooperative games (91A10) Combinatorial optimization (90C27)

Related Items

Computing equilibria for integer programming games

Uses Software

• Maple
• HOMPACK

Cites Work

• A homotopy for solving polynomial systems
• Existence of solutions of games with some non-convexity
• Non-convexity in noncooperative game theory
• On Nash equilibrium
• Algorithm 652
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• 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
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• 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