Combinatorial optimization in Nash games

DOI10.1016/0898-1221(93)90278-4MaRDI QIDQ1802492zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• Combinatorial game theory
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• scientific article; zbMATH DE number 279293
• scientific article; zbMATH DE number 1377714
• An optimization approach for approximate Nash equilibria
• Mathematical Foundations of Computer Science 2004
• Universally balanced combinatorial optimization games
• Cost Allocation in Combinatorial Optimization Games
• Totally balanced combinatorial optimization games

Cites work

• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• scientific article; zbMATH DE number 3827624 (Why is no real title available?)
• scientific article; zbMATH DE number 3677765 (Why is no real title available?)
• scientific article; zbMATH DE number 3731790 (Why is no real title available?)
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• A homotopy for solving polynomial systems
• Algorithm 652
• Equilibrium points in n -person games
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Existence of solutions of games with some non-convexity
• Non-convexity in noncooperative game theory
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• On Nash equilibrium
• On the Number of Solutions to Polynomial Systems of Equations
• Quasi-Equilibria in Markets with Non-Convex Preferences
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models

Cited in

(10)

• Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
• Computing equilibria for integer programming games
• A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
• Collusive game solutions via optimization
• Nash equilibrium problems of polynomials
• Games with combinatorial constraints
• A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
• Polymatrix games and optimization problems
• The computation of Nash equilibrium in fashion games via semi-tensor product method
• Games in oriented matroids

Describes a project that uses

Uses Software

• Maple
• HOMPACK

This page was built for publication: Combinatorial optimization in Nash games

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