How bad is selfish routing?
From MaRDI portal
Publication:3196642
DOI10.1145/506147.506153zbMath1323.90011OpenAlexW2112269231WikidataQ56386816 ScholiaQ56386816MaRDI QIDQ3196642
Publication date: 30 October 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1081
Noncooperative games (91A10) Applications of game theory (91A80) Deterministic network models in operations research (90B10)
Related Items (only showing first 100 items - show all)
Network QoS games: stability vs optimality tradeoff ⋮ Approximation and collusion in multicast cost sharing ⋮ Bounding the inefficiency of equilibria in nonatomic congestion games ⋮ Robust perfect equilibrium in large games ⋮ Nonlinear day-to-day traffic dynamics with driver experience delay: modeling, stability and bifurcation analysis ⋮ On spectrum sharing games ⋮ Greedy distributed optimization of multi-commodity flows ⋮ On the convergence of multicast games in directed networks ⋮ 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 ⋮ On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ Primary versus secondary infrastructure capacity allocation mechanisms ⋮ Collusion in atomic splittable routing games ⋮ Recent studies of agent incentives in Internet resource allocation and pricing ⋮ A note on a selfish bin packing problem ⋮ Optimal externalities in a parallel transportation network ⋮ Sensitivity of wardrop equilibria: revisited ⋮ Resolving Braess's paradox in random networks ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Wary of the worst: maximizing award guarantees when new claimants may arrive ⋮ Agent incentives of a proportional sharing mechanism in resource sharing ⋮ Incentives and coordination in bottleneck models ⋮ Equilibrium and inefficiency in multi-product Cournot games ⋮ Equilibria in routing games with edge priorities ⋮ On equilibria for ADM minimization games ⋮ Demand allocation with latency cost functions ⋮ Smart routing of electric vehicles for load balancing in smart grids ⋮ Efficiency analysis of load balancing games with and without activation costs ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ Online bottleneck matching ⋮ A BGP-based mechanism for lowest-cost routing ⋮ A network pricing game for selfish traffic ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Approximate strong equilibria in job scheduling games with two uniformly related machines ⋮ Stability vs. optimality in selfish ring routing ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Toll caps in privatized road networks ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Competitive contagion in networks ⋮ The worst absolute surplus loss in the problem of commons: random priority versus average cost ⋮ The toll effect on price of anarchy when costs are nonlinear and asymmetric ⋮ A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs ⋮ Bounding the inefficiency of Nash equilibria in games with finitely many players ⋮ Price of anarchy in a linear-state stochastic dynamic game ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ 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 ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ Equilibrium network design of shared-vehicle systems ⋮ An overview of Stackelberg pricing in networks ⋮ 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 ⋮ Bounding the inefficiency of the C-logit stochastic user equilibrium assignment ⋮ Auctioning or assigning an object: some remarkable VCG mechanisms ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Two-group knapsack game ⋮ How much can taxes help selfish routing? ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Computer science and decision theory ⋮ Tradeoffs in worst-case equilibria ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ 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 ⋮ On the efficiency of equilibria in mean-field oscillator games ⋮ The uniqueness property for networks with several origin-destination pairs ⋮ Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 ⋮ Optimal deterministic auctions with correlated priors ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ 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 ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks ⋮ The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates ⋮ 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 ⋮ A survey on networking games in telecommunications ⋮ A paradox in optimal flow control of \(M/M/n\) queues ⋮ A mathematical model for the TCP tragedy of the commons ⋮ Gathering avoiding centralized pedestrian advice framework: an application for Covid-19 outbreak restrictions ⋮ Heterogeneity and chaos in congestion games ⋮ A mixed traffic assignment problem and its upper bound of efficiency loss ⋮ Machine load balancing game with linear externalities ⋮ A game-theoretic perspective of deep neural networks ⋮ Linear tolls suffice: new bounds and algorithms for tolls in single source networks ⋮ Selfish unsplittable flows ⋮ Some anomalies of farsighted strategic behavior ⋮ Bounds on price of anarchy on linear cost functions ⋮ Timed network games ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines ⋮ On the sequential price of anarchy of isolation games
This page was built for publication: How bad is selfish routing?