Pages that link to "Item:Q3611934"
From MaRDI portal
The following pages link to Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach (Q3611934):
Displaying 5 items.
- An approach for reducing the graphical model and genetic algorithm for computing approximate Nash equilibrium in static games (Q614942) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Finding a Nash equilibrium in spatial games is an NP-complete problem (Q1424226) (← links)
- 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 (Q1718839) (← links)
- Nash Equilibria in Certain Two-Choice Multi-Player Games Played on the Ladder Graph (Q5013401) (← links)