The price of selfish routing
From MaRDI portal
Publication:996709
DOI10.1007/S00453-006-0056-1zbMATH Open1137.91007OpenAlexW2070975056WikidataQ126269699 ScholiaQ126269699MaRDI QIDQ996709FDOQ996709
Authors: Marios Mavronicolas, P. G. Spirakis 
Publication date: 19 July 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0056-1
Recommendations
Noncooperative games (91A10) Traffic problems in operations research (90B20) Games involving graphs (91A43) Network design and communication in computer systems (68M10)
Cited In (93)
- The price of anarchy on uniformly related machines revisited
- Reducing price of anarchy of selfish task allocation with more selfishness
- Facets of the fully mixed Nash equilibrium conjecture
- STACS 2004
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- The Influence of Link Restrictions on (Random) Selfish Routing
- Parametric packing of selfish items and the subset sum algorithm
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- The structure and complexity of Nash equilibria for a selfish routing game
- Selfish bin coloring
- Coordination mechanisms for selfish routing over time on a tree
- Cost-sharing in generalised selfish routing
- Nash equilibria in discrete routing games with convex latency functions
- Constraint games for stable and optimal allocation of demands in SDN
- Worst-case Nash equilibria in restricted routing
- Game-theoretic analysis of Internet switching with selfish users
- The complexity of welfare maximization in congestion games
- Tight bounds for selfish and greedy load balancing
- Minimizing expectation plus variance
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Tradeoffs and average-case equilibria in selfish routing
- Title not available (Why is that?)
- Approximation and Online Algorithms
- How much can taxes help selfish routing?
- Traffic routing oligopoly
- Self-fulfilling signal of an endogenous state in network congestion games
- The impact of oligopolistic competition in networks
- Selfish routing with atomic players
- Mathematical Foundations of Computer Science 2003
- ``Beat-your-rival routing games
- Nash equilibrium design and price-based coordination in hierarchical systems
- Equilibria in routing games with edge priorities
- Bottleneck routing with elastic demands
- The price of atomic selfish ring routing
- Atomic routing games on maximum congestion
- Tradeoffs in worst-case equilibria
- Strategic pricing in next-hop routing with elastic demands
- Strategic pricing in next-hop routing with elastic demands
- Non-cooperative routing in loss networks
- Approximate equilibria and ball fusion
- The price of routing unsplittable flow
- Integer Programming and Combinatorial Optimization
- Structural Information and Communication Complexity
- Title not available (Why is that?)
- How bad is selfish routing?
- Designing fast converging cost sharing methods for multicast transmissions
- Bottleneck congestion games with logarithmic price of anarchy
- A selective tour through congestion games
- Bottleneck links, variable demand, and the tragedy of the commons
- Efficiency Loss in a Network Resource Allocation Game
- Routing into two parallel links: Game-theoretic distributed algorithms
- Routing games
- Title not available (Why is that?)
- The price of anarchy for polynomial social cost
- A new model for selfish routing
- Algorithms – ESA 2004
- A bin packing game with cardinality constraints under the best cost rule
- Incentives and coordination in bottleneck models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast convergence of selfish rerouting
- Mathematical Foundations of Computer Science 2004
- Facets of the Fully Mixed Nash Equilibrium Conjecture
- Worst-case equilibria
- Worst-case equilibria
- Fast, Fair, and Efficient Flows in Networks
- Approximation and Online Algorithms
- Cost sharing mechanisms for fair pricing of resource usage
- Selfish vector packing
- Selfish vector packing
- Equilibria in dynamic selfish routing
- The price of selfish routing
- The price of anarchy is independent of the network topology
- Selfish Routing with Oblivious Users
- Resilience of routing in parallel link networks
- Tradeoffs and Average-Case Equilibria in Selfish Routing
- SOFSEM 2006: Theory and Practice of Computer Science
- Maximizing the minimum load: the cost of selfishness
- Which is the worst-case Nash equilibrium?
- A class of selfish routing with oblivious agents
- Selfish routing
- GPS navigation apps and the price of anarchy
- Money-based coordination of network packets
- Oligopolistic competitive packet routing
- An improved tax scheme for selfish routing
- Mixed Nash equilibria in selfish routing problems with dynamic constraints
- Coordination complexity: small information coordinating large populations
- Scheduling selfish jobs on multidimensional parallel machines
- The Value of Information in Selfish Routing
- A glimpse at Paul G. Spirakis
- Computing the price of anarchy in atomic network congestion games (invited talk)
- On equilibria for ADM minimization games
This page was built for publication: The price of selfish routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996709)
