How bad is selfish routing?

From MaRDI portal
Publication:3196642

DOI10.1145/506147.506153zbMath1323.90011OpenAlexW2112269231WikidataQ56386816 ScholiaQ56386816MaRDI QIDQ3196642

Éva Tardos, Tim Roughgarden

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




Related Items (only showing first 100 items - show all)

Network QoS games: stability vs optimality tradeoffApproximation and collusion in multicast cost sharingBounding the inefficiency of equilibria in nonatomic congestion gamesRobust perfect equilibrium in large gamesNonlinear day-to-day traffic dynamics with driver experience delay: modeling, stability and bifurcation analysisOn spectrum sharing gamesGreedy distributed optimization of multi-commodity flowsOn the convergence of multicast games in directed networksModelling equilibrium for a multi-criteria selfish routing network equilibrium flow problemThe Price of Anarchy of generic valid utility systemsA game-theoretic analysis of deep neural networksBeyond Pigouvian taxes: a worst case analysisOn the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demandsA traffic congestion analysis by user equilibrium and system optimum with incomplete informationPrimary versus secondary infrastructure capacity allocation mechanismsCollusion in atomic splittable routing gamesRecent studies of agent incentives in Internet resource allocation and pricingA note on a selfish bin packing problemOptimal externalities in a parallel transportation networkSensitivity of wardrop equilibria: revisitedResolving Braess's paradox in random networksThe quality of equilibria for set packing and throughput scheduling gamesWary of the worst: maximizing award guarantees when new claimants may arriveAgent incentives of a proportional sharing mechanism in resource sharingIncentives and coordination in bottleneck modelsEquilibrium and inefficiency in multi-product Cournot gamesEquilibria in routing games with edge prioritiesOn equilibria for ADM minimization gamesDemand allocation with latency cost functionsSmart routing of electric vehicles for load balancing in smart gridsEfficiency analysis of load balancing games with and without activation costsThe price of stability for undirected broadcast network design with fair cost allocation is constantOnline bottleneck matchingA BGP-based mechanism for lowest-cost routingA network pricing game for selfish trafficDesigning fast converging cost sharing methods for multicast transmissionsApproximate strong equilibria in job scheduling games with two uniformly related machinesStability vs. optimality in selfish ring routingA survey on the continuous nonlinear resource allocation problemToll caps in privatized road networksThe minimum tollbooth problem in atomic network congestion games with unsplittable flowsCompetitive contagion in networksThe worst absolute surplus loss in the problem of commons: random priority versus average costThe toll effect on price of anarchy when costs are nonlinear and asymmetricA polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphsBounding the inefficiency of Nash equilibria in games with finitely many playersPrice of anarchy in a linear-state stochastic dynamic gameImproving the price of anarchy for selfish routing via coordination mechanismsIntroduction to computer science and economic theoryLocal smoothness and the price of anarchy in splittable congestion gamesOn cost sharing in the provision of a binary and excludable public goodMixed Nash equilibria in selfish routing problems with dynamic constraintsEquilibrium network design of shared-vehicle systemsAn overview of Stackelberg pricing in networksCongestion control for a system with parallel stations and homogeneous customers using priority passesBounding the inefficiency of the reliability-based continuous network design problem under cost recoveryBounding the inefficiency of the C-logit stochastic user equilibrium assignmentAuctioning or assigning an object: some remarkable VCG mechanismsEvolutionary equilibrium in Bayesian routing games: specialization and niche formationTwo-group knapsack gameHow much can taxes help selfish routing?On the severity of Braess's paradox: designing networks for selfish users is hardComputer science and decision theoryTradeoffs in worst-case equilibriaAchieving target equilibria in network routing games without knowing the latency functionsEquilibrium strategies for multiple interdictors on a common networkThe price of anarchy of affine congestion games with similar strategiesDynamic resource allocation gamesRecursively modeling other agents for decision making: a research perspectiveOn the efficiency of equilibria in mean-field oscillator gamesThe uniqueness property for networks with several origin-destination pairsIntroduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011Optimal deterministic auctions with correlated priorsThe sequential price of anarchy for affine congestion games with few playersA geometric approach to the price of anarchy in nonatomic congestion gamesOn the price of anarchy of two-stage machine scheduling gamesExact enforcement value of soft correlated equilibrium for generalized chicken and prisoner's dilemma gamesQuality of strong equilibria for selfish bin packing with uniform cost sharingPathwise smooth splittable congestion games and inefficiencyCapacity-constrained wardrop equilibria and application to multi-connectivity in 5G networksThe linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation ratesUrgency-aware optimal routing in repeated games through artificial currenciesEstimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic gameOn weak Pareto optimality of nonatomic routing networksAtomic congestion games with random players: network equilibrium and the price of anarchyA survey on networking games in telecommunicationsA paradox in optimal flow control of \(M/M/n\) queuesA mathematical model for the TCP tragedy of the commonsGathering avoiding centralized pedestrian advice framework: an application for Covid-19 outbreak restrictionsHeterogeneity and chaos in congestion gamesA mixed traffic assignment problem and its upper bound of efficiency lossMachine load balancing game with linear externalitiesA game-theoretic perspective of deep neural networksLinear tolls suffice: new bounds and algorithms for tolls in single source networksSelfish unsplittable flowsSome anomalies of farsighted strategic behaviorBounds on price of anarchy on linear cost functionsTimed network gamesInefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machinesOn the sequential price of anarchy of isolation games




This page was built for publication: How bad is selfish routing?