119 search results - page 19 / 24 » The complexity of pure Nash equilibria |
116
click to vote
SIGECOM
2011
ACM
14 years 10 days ago
2011
ACM
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
81
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
123
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
109
click to vote
JAIR
2011
14 years 12 days ago
2011
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...