Combinatorial optimization in Nash games
From MaRDI portal
Publication:1802492
DOI10.1016/0898-1221(93)90278-4zbMATH Open0778.90092OpenAlexW2050703074MaRDI QIDQ1802492FDOQ1802492
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
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
- Algorithm 652
- Equilibrium points in n -person games
- Title not available (Why is that?)
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- On the Number of Solutions to Polynomial Systems of Equations
- Quasi-Equilibria in Markets with Non-Convex Preferences
- A homotopy for solving polynomial systems
- Title not available (Why is that?)
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Existence of solutions of games with some non-convexity
- Non-convexity in noncooperative game theory
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- On Nash equilibrium
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
- Polymatrix games and optimization problems
- The computation of Nash equilibrium in fashion games via semi-tensor product method
- Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements
- Computing equilibria for integer programming games
- Games with combinatorial constraints
- Collusive game solutions via optimization
- Games in oriented matroids
Uses Software
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)
