Searching for "Selfish Routing in Networks." – sorted by Relevance.
-
Atomic selfish routing in networks: A survey
- Atomic Selfish Routing in Networks: A Survey Spyros Kontogiannis †,‡ Paul Spirakis ‡ April 25
- Cited by 6 (2 self) – Add To MetaCart
-
How Much Can Taxes Help Selfish Routing?
- of selfish routing in which the latency experienced by network traffic on an edge of the network is a
- Cited by 35 (3 self) – Add To MetaCart
-
Selfish Routing and the Price of Anarchy
- a congested network. The outcome of selfish routing is generally inefficient, in that it fails
- Cited by 55 (6 self) – Add To MetaCart
-
How bad is selfish routing
- function of its congestion, then the total latency of the routes chosen by selfish network users is at most
- Cited by 295 (19 self) – Add To MetaCart
-
Routing Games
- selfish routing networks. Example 18.3 (Nonlinear Pigou’s example) The inefficiency of the equilibrium
- Cited by 1 (1 self) – Add To MetaCart
-
An algorithmic game theory primer
- selfish network user routed on the first edge would switch to the second edge, indifferent to the fact
- Cited by 1 (0 self) – Add To MetaCart
-
Hardness and Approximation Algorithms of Some Graph Problems
- in a setting of selfish routing networks, showing the existence of Nash equilibria in a model derived
- Add To MetaCart
-
Designing networks with good equilibria
- the price of anarchy of a given game; see, for example, previous work on pricing selfish routing networks
- Cited by 4 (3 self) – Add To MetaCart
-
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
- for economic aspects of the internet, such as electronic commerce, selfish routing in networks [28
- Cited by 24 (1 self) – Add To MetaCart
-
Energy efficient connectivity in ad hoc networks from user’s and designer’s perspective
- of the social optimum. Roughgarden and Tardos [20] derive the price of anarchy of selfish routing in networks
- Cited by 1 (0 self) – Add To MetaCart

