Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
From MaRDI portal
Recommendations
- On the complexity of constrained Nash equilibria in graphical games
- On some approaches to find Nash equilibrium in concave games
- Pure Nash equilibria in graphical games and treewidth
- scientific article; zbMATH DE number 6822826
- Pure Nash equilibria in concurrent deterministic games
- Pure Nash Equilibria in Resource Graph Games
- Existence of Nash equilibria for constrained stochastic games
- Solving a class of generalized Nash equilibrium problems
- On a general scheme of constructing iterative methods for searching for a Nash equilibrium in concave games
- An algorithm for determining a class of two-person games having a pure-strategy Nash equilibrium
Cited in
(8)- On the complexity of constrained Nash equilibria in graphical games
- A distributed asynchronous solver for Nash equilibria in hypergraphical games
- A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
- A metaheuristic approach to compute pure Nash equilibria
- An approach for reducing the graphical model and genetic algorithm for computing approximate Nash equilibrium in static 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
- Nash equilibria in certain two-choice multi-player games played on the ladder graph
- Finding a Nash equilibrium in spatial games is an NP-complete problem
This page was built for publication: Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611934)
