Results 181 to 190 of about 1,225 (207)
Some of the next articles are maybe not open access.
Dynamisches eigennütziges RoutingDynamic Selfish Routing
itit, 2009Zusammenfassung In der algorithmischen Spieltheorie modellieren wir das Verhalten von eigennützigen Agenten in großen Netzwerken als strategisches Spiel: Jeder Agent versucht, den eigenen Nutzen zu maximieren, ohne dabei auf mögliche Verschlechterungen für andere Agenten Rücksicht zu nehmen.
openaire +1 more source
Genericity and congestion control in selfish routing
2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601), 2004We consider the problem of selfish routing in a congested data network, such as the Internet. While previous analyses have discussed the possibility of large losses due to selfish routing, we present several reasons why one could expect typical losses to be small.
openaire +1 more source
SELFISH ROUTING IN NON-COOPERATIVE NETWORKS: A SURVEY
2003We study the problem of n users selfishly routing traffics through a shared network. Users route their traffics by choosing a path from their source to their destination of the traffic with the aim of minimizing their private latency. In such an environment Nash equilibria represent stable states of the system: no user can improve its private latency ...
Rainer Feldmann +4 more
openaire +1 more source
Pricing Networks with Selfish Routing
2003Abstract : We study the negative consequences of selfish behavior in networks and economic means of influencing such behavior. We focus on a simple model of selfish routing, defined by Wardrop and first studied from a theoretical computer science perspective by Roughgarden and Tardos.
Tim Roughgarden +2 more
openaire +1 more source
A Survey of Uniqueness Results for Selfish Routing
2007We consider the problem of selfish or competitive routing over a network with flow-dependent costs which is shared by a finite number of users, each wishing to minimize the total cost of its own flow. The Nash Equilibrium is well known to exist for this problem under mild convexity assumptions on the cost function of each user.
openaire +1 more source
Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
Mathematics of Operations Research, 2007Nahum Shimkin
exaly
On selfish routing in Internet-like environments
IEEE/ACM Transactions on Networking, 2006S Shenker
exaly
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science, 2009Dimitris Fotakis +2 more
exaly
Tradeoffs and Average-Case Equilibria in Selfish Routing
ACM Transactions on Computation Theory, 2010Martin Hoefer, Alexander Souza
exaly