A metaheuristic approach to compute pure Nash equilibria
From MaRDI portal
(Redirected from Publication:5111130)
Recommendations
- Complexity of pure-strategy Nash equilibria in non-cooperative games
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form
- The complexity of pure Nash equilibria
- Mathematical Foundations of Computer Science 2005
- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
Cites work
- An optimization approach for approximate Nash equilibria
- Combining simulated annealing with local search heuristics
- Efficient computation of approximate pure Nash equilibria in congestion games
- Equilibrium Points of Bimatrix Games
- scientific article; zbMATH DE number 2038734 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 2243403 (Why is no real title available?)
- Optimization by simulated annealing
- The complexity of computing a Nash equilibrium
- The complexity of pure Nash equilibria
Cited in
(4)- A heuristic procedure for seeking equilibria in coalitionless and antagonistic games
- Computing Nash equilibria through computational intelligence methods
- scientific article; zbMATH DE number 2034487 (Why is no real title available?)
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
This page was built for publication: A metaheuristic approach to compute pure Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111130)