Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CSJM
2006

favoriteEmaildiscussreport

81views more CSJM 2006»

Nash equilibria set computing in finite extended games

13 years 4 months ago

Nash equilibria set computing in finite extended games

Download www.math.md

The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A method for NES computing is studied. Mathematics Subject Classification 2000: 91A05, 91A06, 91A10, 91A44, 90C05, 90C31, 90C90. Keywords and phrases: Noncooperative game, normal form game, Nash equilibrium (NE), Nash equilibria set (NES), graph of best response mapping, intersection, method, algorithm, computational complexity.

Valeriu Ungureanu

Real-time Traffic

CSJM 2006 | Mathematics Subject Classification | Multi-matrix Extended Games | Nash Equilibria |

claim paper

Related Content

» Correlated Equilibria in Continuous Games Characterization and Computation

» Computing Equilibria in TwoPlayer Timed Games via TurnBased Finite Games

» From Computing Sets of Optima Pareto Sets and Sets of Nash Equilibria to General DecisionR...

» The price of anarchy of finite congestion games

» Structure of Extreme Correlated Equilibria

» Achieving symmetric Pareto Nash equilibria using biased replicator dynamics

» Quantum Strategic Game Theory

» A parametric representation of totally mixed Nash equilibria

» Robust game theory

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CSJM
Authors	Valeriu Ungureanu

Comments (0)