How bad is selfish routing?
From MaRDI portal
Publication:3196642
DOI10.1145/506147.506153zbMATH Open1323.90011OpenAlexW2112269231WikidataQ56386816 ScholiaQ56386816MaRDI QIDQ3196642FDOQ3196642
Recommendations
- Selfish routing
- When is selfish routing bad? The price of anarchy in light and heavy traffic
- The price of selfish routing
- The price of selfish routing
- SOFSEM 2006: Theory and Practice of Computer Science
- How much can taxes help selfish routing?
- scientific article; zbMATH DE number 2119661
- Algorithms – ESA 2004
- Selfish Routing with Oblivious Users
- Selfish routing in public services
Cited in
(only showing first 100 items - show all)- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Nash equilibria and the price of anarchy for flows over time
- On spectrum sharing games
- Truthful mechanisms for selfish routing and two-parameter agents
- The price of anarchy on uniformly related machines revisited
- Minimizing Rosenthal potential in multicast games
- Buyer-supplier games: optimization over the core
- Local and global price of anarchy of graphical games
- Utilitarian resource assignment
- Worst-case Nash equilibria in restricted routing
- Equilibria in routing games with edge priorities
- Price of anarchy for supply chains with partial positive externalities
- The price of atomic selfish ring routing
- Connectivity and equilibrium in random games
- Strong mediated equilibrium
- Coordination mechanisms
- Network routing
- Monotonicity properties of user equilibrium policies for parallel batch systems
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- Subjective-cost policy routing
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Restrictive mechanism of flow control among non-cooperative internet users
- A selfish routing based network improvement problem
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- On the efficiency of price competition
- Equilibrium and inefficiency in multi-product Cournot games
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Profit loss in differentiated oligopolies
- Efficient methods for selfish network design
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Tradeoffs in worst-case equilibria
- Synthesis from component libraries with costs
- Selfishness need not be bad
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- The price of anarchy for polynomial social cost
- Price and capacity competition
- Price of anarchy for parallel link networks with generalized mean objective
- Price competition with elastic traffic
- Telecommunications network design: Technology impacts and future directions
- A mixed traffic assignment problem and its upper bound of efficiency loss
- Dynamic resource allocation games
- Local smoothness and the price of anarchy in splittable congestion games
- On the price of anarchy of highly congested nonatomic network games
- Approximate Strong Equilibrium in Job Scheduling Games
- Nash equilibria in discrete routing games with convex latency functions
- The price of optimum: complexity and approximation for a matching game
- On the efficiency of the proportional allocation mechanism for divisible resources
- Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- Stability vs. optimality in selfish ring routing
- Network characterizations for excluding Braess's paradox
- A BGP-based mechanism for lowest-cost routing
- Braess's Paradox in large random graphs
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- A mean-risk model for the traffic assignment problem with stochastic travel times
- Introduction to computer science and economic theory
- Network pricing: how to induce optimal flows under strategic link operators
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
- Convergence of best-response dynamics in games with conflicting congestion effects
- Network topologies for weakly Pareto optimal nonatomic selfish routing
- Fast, Fair, and Efficient Flows in Networks
- Selfish bin packing
- On the performance of approximate equilibria in congestion games
- Designing fast converging cost sharing methods for multicast transmissions
- A survey on networking games in telecommunications
- Adaptive routing with stale information
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Convergence and approximation in potential games
- The combination of continuous network design and route guidance
- Computing approximate Nash equilibria in network congestion games
- Demand allocation with latency cost functions
- Online bottleneck matching
- Tight bounds for cost-sharing in weighted congestion games
- Cooperative power-aware scheduling in grid computing environments
- The price of selfish routing
- Computing Approximate Nash Equilibria in Network Congestion Games
- Computer science and decision theory
- The toll effect on price of anarchy when costs are nonlinear and asymmetric
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Bottleneck congestion games with logarithmic price of anarchy
- scientific article; zbMATH DE number 2119661 (Why is no real title available?)
- Non-cooperative facility location and covering games
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- Congestion games with malicious players
- Collusion in atomic splittable routing games
- Stackelberg strategies and collusion in network games with splittable flow
- The uniqueness property for networks with several origin-destination pairs
- Serve or skip: the power of rejection in online bottleneck matching
- Atomic routing games on maximum congestion
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Self-interested routing in queueing networks
- Approximation and collusion in multicast cost sharing
- Approximating Wardrop equilibria with finitely many agents
- Robust perfect equilibrium in large games
- An efficient and almost budget balanced cost sharing method
- Toward microeconomic allocation of resources in multi-service overlay networks
- Non-cooperative tree creation
- Some anomalies of farsighted strategic behavior
- Stackelberg strategies for selfish routing in general multicommodity networks
This page was built for publication: How bad is selfish routing?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196642)
