119 search results - page 6 / 24 » The complexity of pure Nash equilibria |
72
Voted
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
74
Voted
ACMICEC
2007
ACM
15 years 1 months ago
2007
ACM
We study vindictive bidding, a strategic bidding behavior in keyword auctions where a bidder forces his competitor to pay more without affecting his own payment. We show that most...
79
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...