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)- Almost budget-balanced VCG mechanisms to assign multiple objects
- Profit loss in differentiated oligopolies
- Strong price of anarchy
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Non-cooperative tree creation
- Stackelberg strategies for selfish routing in general multicommodity networks
- Price and capacity competition
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Two-terminal routing games with unknown active players
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Potential games, path independence and Poisson's binomial distribution
- An abstraction-refinement methodology for reasoning about network games
- Probabilistic selfish routing in parallel batch and single-server queues
- Congestion avoiding heuristic path generation for the proactive route guidance
- Strategic pricing in next-hop routing with elastic demands
- Wardrop equilibrium on time-varying graphs
- Recent studies of agent incentives in internet resource allocation and pricing
- Price of anarchy for highly congested routing games in parallel networks
- Toll caps in privatized road networks
- Competitive contagion in networks
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Price of anarchy in a linear-state stochastic dynamic game
- Avoiding routing loops on the internet
- Network QoS games: stability vs optimality tradeoff
- Approximation and collusion in multicast cost sharing
- Bounding the inefficiency of equilibria in nonatomic congestion games
- A BGP-based mechanism for lowest-cost routing
- A network pricing game for selfish traffic
- Designing fast converging cost sharing methods for multicast transmissions
- Congestion control for a system with parallel stations and homogeneous customers using priority passes
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Constraint games for stable and optimal allocation of demands in SDN
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- Equilibrium strategies for multiple interdictors on a common network
- On the price of anarchy of two-stage machine scheduling games
- Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
- Urgency-aware optimal routing in repeated games through artificial currencies
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game
- On weak Pareto optimality of nonatomic routing networks
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- Gathering avoiding centralized pedestrian advice framework: an application for Covid-19 outbreak restrictions
- Machine load balancing game with linear externalities
- A game-theoretic perspective of deep neural networks
- Timed network games
- Robust perfect equilibrium in large games
- Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem
- The Price of Anarchy of generic valid utility systems
- A game-theoretic analysis of deep neural networks
- Beyond Pigouvian taxes: a worst case analysis
- A traffic congestion analysis by user equilibrium and system optimum with incomplete information
- Primary versus secondary infrastructure capacity allocation mechanisms
- Recent studies of agent incentives in Internet resource allocation and pricing
- Optimal externalities in a parallel transportation network
- Sensitivity of wardrop equilibria: revisited
- The quality of equilibria for set packing and throughput scheduling games
- Incentives and coordination in bottleneck models
- Equilibrium and inefficiency in multi-product Cournot games
- Equilibria in routing games with edge priorities
- Smart routing of electric vehicles for load balancing in smart grids
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows
- Introduction to computer science and economic theory
- Local smoothness and the price of anarchy in splittable congestion games
- On cost sharing in the provision of a binary and excludable public good
- Equilibrium network design of shared-vehicle systems
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- Two-group knapsack game
- Computer science and decision theory
- Achieving target equilibria in network routing games without knowing the latency functions
- The price of anarchy of affine congestion games with similar strategies
- Dynamic resource allocation games
- Recursively modeling other agents for decision making: a research perspective
- The sequential price of anarchy for affine congestion games with few players
- Exact enforcement value of soft correlated equilibrium for generalized chicken and prisoner's dilemma games
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Pathwise smooth splittable congestion games and inefficiency
- The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates
- Heterogeneity and chaos in congestion games
- A mixed traffic assignment problem and its upper bound of efficiency loss
- Some anomalies of farsighted strategic behavior
- Self-adjusting grid networks to minimize expected path length
- Bounds on price of anarchy on linear cost functions
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
- On the sequential price of anarchy of isolation games
- On spectrum sharing games
- Greedy distributed optimization of multi-commodity flows
- On the convergence of multicast games in directed networks
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands
- Collusion in atomic splittable routing games
- A note on a selfish bin packing problem
- Resolving Braess's paradox in random networks
- Wary of the worst: maximizing award guarantees when new claimants may arrive
- Agent incentives of a proportional sharing mechanism in resource sharing
- On equilibria for ADM minimization games
- Demand allocation with latency cost functions
- Efficiency analysis of load balancing games with and without activation costs
- Online bottleneck matching
- Approximate strong equilibria in job scheduling games with two uniformly related machines
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)
