54 search results - page 4 / 11 » Complexity Results about Nash Equilibria |
162
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
173
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
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 mod...
139
click to vote
SPAA
2006
ACM
15 years 12 months ago
2006
ACM
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
168
click to vote
STACS
2007
Springer
16 years 4 days ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
149
click to vote
COCOON
2008
Springer
15 years 7 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...