23 search results - page 3 / 5 » Computing Pure Nash Equilibria in Symmetric Action Graph Gam... |
CSE
2009
IEEE
13 years 10 months ago
2009
IEEE
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
SIGECOM
2006
ACM
14 years 10 days ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
MOBIHOC
2012
ACM
11 years 8 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
SIGECOM
2004
ACM
13 years 11 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
COCOON
2008
Springer
13 years 8 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...