Selfish Routing in Capacitated Networks
From MaRDI portal
Publication:5704208
DOI10.1287/moor.1040.0098zbMath1082.90009OpenAlexW2106800330WikidataQ65553926 ScholiaQ65553926MaRDI QIDQ5704208
Nicolás E. Stier-Moses, Andreas S. Schulz, José R. Correa
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/3533
Programming involving graphs or networks (90C35) Convex programming (90C25) Noncooperative games (91A10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Games with infinitely many players (91A07)
Related Items (98)
Bounding the inefficiency of equilibria in nonatomic congestion games ⋮ Optimal cost sharing for capacitated facility location games ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ Competitive online multicommodity routing ⋮ Nonatomic aggregative games with infinitely many types ⋮ Improving Selfish Routing for Risk-Averse Players ⋮ Efficiency analysis with respect to the unit cost objectives in scheduling games ⋮ Price competition with elastic traffic ⋮ A Selective Tour Through Congestion Games ⋮ 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 ⋮ Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions ⋮ Unnamed Item ⋮ Network-formation games with regular objectives ⋮ Collusion in atomic splittable routing games ⋮ Atomic routing game with capacity constraints ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ Complexity and Approximation of the Continuous Network Design Problem ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ A note on social learning in non-atomic routing games ⋮ The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing ⋮ The price of anarchy in series-parallel network congestion games ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ Capacitated network design games ⋮ Congestion games with capacitated resources ⋮ The price of anarchy in routing games as a function of the demand ⋮ On the performance of approximate equilibria in congestion games ⋮ Price of anarchy for supply chains with partial positive externalities ⋮ Efficient methods for selfish network design ⋮ Repeated congestion games with bounded rationality ⋮ A network pricing game for selfish traffic ⋮ When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ Toll caps in privatized road networks ⋮ Hierarchical Network Formation Games ⋮ The toll effect on price of anarchy when costs are nonlinear and asymmetric ⋮ Computation and efficiency of potential function minimizers of combinatorial congestion games ⋮ A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints ⋮ Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game ⋮ Bounding the inefficiency of Nash equilibria in games with finitely many players ⋮ Price of anarchy in a linear-state stochastic dynamic game ⋮ New bounds for the price of anarchy under nonlinear and asymmetric costs ⋮ Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ 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 ⋮ The effect of supplier capacity on the supply chain profit ⋮ Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS ⋮ Constraint games for stable and optimal allocation of demands in SDN ⋮ Connectivity and equilibrium in random games ⋮ Bounding the inefficiency of the C-logit stochastic user equilibrium assignment ⋮ 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 ⋮ Stackelberg strategies for atomic congestion games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ A note on a parameter relating traffic equilibria and system optimal routing ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ On the efficiency of equilibria in mean-field oscillator games ⋮ Profit loss in differentiated oligopolies ⋮ A Stackelberg strategy for routing flow over time ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ The path player game ⋮ Selfish routing in public services ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ Price of Pareto optimality in hedonic games ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Improving selfish routing for risk-averse players ⋮ Edge pricing of multicommodity networks for selfish users with elastic demands ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ Existence of equilibria in a decentralized two-level supply chain ⋮ Risk-Averse Selfish Routing ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Non-cooperative tree creation ⋮ Stackelberg strategies for selfish routing in general multicommodity networks ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks ⋮ Price and capacity competition ⋮ Traffic Networks and Flows over Time ⋮ Models of Non-atomic Congestion Games – From Unicast to Multicast Routing ⋮ Efficiency of atomic splittable selfish routing with polynomial cost functions ⋮ Wealth Inequality and the Price of Anarchy ⋮ Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds ⋮ Bounding the inefficiency of logit-based stochastic user equilibrium ⋮ Selfishness Need Not Be Bad ⋮ Atomic congestion games with random players: network equilibrium and the price of anarchy ⋮ A mixed traffic assignment problem and its upper bound of efficiency loss ⋮ On Pareto optimality in social distance games ⋮ A unifying approximate potential for weighted congestion games ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times ⋮ Bottleneck links, variable demand, and the tragedy of the commons
This page was built for publication: Selfish Routing in Capacitated Networks
