80 search results - page 4 / 16 » Existence of Nash Equilibria in Selfish Routing Problems |
CSL
2009
Springer
14 years 10 days ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
CAAN
2007
Springer
13 years 9 months ago
2007
Springer
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
ESA
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...
ACMICEC
2007
ACM
13 years 9 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...