54 search results - page 6 / 11 » Complexity Results about Nash Equilibria |
112
click to vote
JAIR
2011
14 years 29 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...
CONCUR
2007
Springer
15 years 4 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
71
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
SIGECOM
2010
ACM
14 years 10 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....