Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
From MaRDI portal
Publication:3611934
DOI10.1007/978-3-540-74450-4_43zbMath1176.91020OpenAlexW1548312390MaRDI QIDQ3611934
Publication date: 3 March 2009
Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_43
Related Items (2)
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
This page was built for publication: Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
