28 search results - page 2 / 6 » A technique for reducing normal-form games to compute a Nash... |
CSJM
2006
13 years 5 months ago
2006
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 me...
SIGECOM
2010
ACM
13 years 5 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
PODC
1995
ACM
13 years 9 months ago
1995
ACM
We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms ...
AMEC
2003
Springer
13 years 10 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...