Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks

No abstract is available for this paper.

• Publication year

  year unknown

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Traffic Assignment Problem: Models and Methods

  2015influential reference
• Bounding the inefficiency of equilibria in nonatomic congestion games

  2004cited by this paper
• A Strategic Flow Model of Traffic Assignment in Static Capacitated Networks

  2004cited by this paper
• The price of anarchy is independent of the network topology

  2002influential reference
• Algorithms, games, and the internet

  2001cited by this paper
• How bad is selfish routing?

  2000influential reference
• Side constrained traffic equilibrium models: analysis, computation and applications

  1999cited by this paper
• Optimization formulations and static equilibrium in congested transportation networks

  1998cited by this paper
• An augmented lagrangean dual algorithm for link capacity side constrained traffic assignment problems

  1995cited by this paper
• Equilibrium characterizations of solutions to side constrained asymmetric traffic assignment models

  1995cited by this paper
• Equilibria for Networks with Lower Semicontinuous Costs: With an Application to Congestion Pricing

  1994cited by this paper
• Contributions of Transportation Network Modeling to the Development of a Real-Time Route Guidance System

  1989cited by this paper
• Transportation Planning Models

  1987cited by this paper
• MODELS AND ALGORITHMS FOR PREDICTING URBAN TRAFFIC EQUILIBRIA

  1984cited by this paper
• Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems

  1981cited by this paper
• The effect on equilibrium trip assignment of different link congestion functions

  1981cited by this paper
• Pilot study of computer-based urban traffic management

  1980cited by this paper
• Traffic Equilibrium and Variational Inequalities

  1980cited by this paper
• The existence, uniqueness and stability of traffic equilibria

  1979cited by this paper
• On the traffic assignment problem with flow dependent costs—II

  1977cited by this paper
• Traffic assignment problem for a general network

  1969cited by this paper
• Über ein Paradoxon aus der Verkehrsplanung

  1968cited by this paper
• THE LAW OF PEAK-HOUR EXPRESSWAY CONGESTION

  1962cited by this paper
• Some Theoretical Aspects of Road Traffic Research

  1952cited by this paper
• Some Fallacies in the Interpretation of Social Cost

  1924cited by this paper

• Facility location and restoration games

  2024cites this paper
• Designing High-Occupancy Toll Lanes: A Game-Theoretic Analysis

  2024cites this paper
• Re-routing game: The inadequacy of mean-field approach in modeling the herd behavior in path switching

  2024cites this paper
• Congestion-Mitigating Spatiotemporal Routing in Road Networks

  2024cites this paper
• Towards a more flexible demand responsive transit service with compensation mechanism considering boundedly rational passengers

  2023cites this paper
• Travel demand matrix estimation for strategic road traffic assignment models with strict capacity constraints and residual queues

  2023cites this paper
• Noncooperative Model Predictive Game With Markov Jump Graph

  2023cites this paper
• Bi-objective optimization models for mitigating traffic congestion in urban road networks

  2023cites this paper
• A note on social learning in non-atomic routing games

  2023cites this paper
• Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost

  2023cites this paper
• Master Equation for Discrete-Time Stackelberg Mean Field Games with a Single Leader

  2022cites this paper
• Master equation of discrete-time Stackelberg mean field games with multiple leaders

  2022cites this paper
• The price of Anarchy in series-parallel network congestion games

  2022cites this paper
• On Partial Adoption of Vehicle-to-Vehicle Communication: When Should Cars Warn Each Other of Hazards?

  2022cites this paper
• Side-Constrained Dynamic Traffic Equilibria

  2022influential citation
• Information Design for Vehicle-to-Vehicle Communication

  2022cites this paper
• A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games

  2022cites this paper
• Generalized Link-Cost Function and Network Design for Dedicated Truck-Platoon Lanes to Improve Energy, Pavement Sustainability, and Traffic Efficiency

  2021cites this paper
• Capacity-constrained Wardrop equilibria and application to multi-connectivity in 5G networks

  2021cites this paper
• A microsimulation based analysis of the price of anarchy in traffic routing: The enhanced Braess network case

  2021cites this paper
• Efficiency and Stability in Euclidean Network Design

  2021cites this paper
• Subgroup fairness in two-sided markets

  2021cites this paper
• Bounding the Inefficiency of the Multiclass, Multicriteria C-Logit Stochastic User Equilibrium in a Transportation Network

  2021cites this paper
• Mathematical Based Models for Group Decision Support in Telecommunication Network Design and Management—Challenges and Trends

  2021cites this paper
• Coupled Queueing and Charging Game Model with Energy Capacity Optimization

  2021cites this paper
• Equilibrium strategies for multiple interdictors on a common network

  2021cites this paper
• Value Loss in Allocation Systems with Provider Guarantees

  2020cites this paper
• Existence and Complexity of Approximate Equilibria in Weighted Congestion Games

  2020cites this paper
• Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology

  2020cites this paper
• Coverage and Vacuity in Network Formation Games

  2020cites this paper
• Bounding the Inefficiency of the Reliability-Based Continuous Network Design Problem Under Cost Recovery

  2020cites this paper
• The Price of Anarchy of Affine Congestion Games with Similar Strategies

  2020cites this paper
• Bounding the efficiency gain of differentiable road pricing for EVs and GVs to manage congestion and emissions

  2020cites this paper
• TRANSIT ASSIGNMENT MODEL FOR EXPRESS TRAINS BASED ON INVERSE OPTIMIZATION

  2020cites this paper
• Congestion Games with Priority-Based Scheduling

  2020cites this paper
• Bounding the Efficiency Loss of Logit-Based Stochastic User Equilibrium under Tradable Credit Scheme

  2020cites this paper
• Atomic congestion games with random players: network equilibrium and the price of anarchy

  2020cites this paper
• A convergence analysis of the price of anarchy in atomic congestion games

  2020cites this paper
• Wardrop’s First Principle: Extension for Capacitated Networks

  2020influential citation
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information

  2020cites this paper
• Computation and efficiency of potential function minimizers of combinatorial congestion games

  2020cites this paper
• Pathwise smooth splittable congestion games and inefficiency

  2020cites this paper
• Intermodal Hinterland Network Design Games

  2020cites this paper
• Bounding the Inefficiency of the Reliability-Based Continuous Network Design Problem Under Cost Recovery

  2019cites this paper
• PRICE OF ANARCHY IN ATOMIC CONGESTION GAMES WITH STOCHASTIC DEMANDS AND AFFINE COSTS

  2019cites this paper
• Effect of reducing the price of anarchy on fairness in highway resource allocation for individual users

  2019cites this paper
• Scheduling Vehicles for On-Time Arrival using Route-Reservations

  2019cites this paper
• Paradox links can improve system efficiency: An illustration in traffic assignment problem

  2019cites this paper
• User Equilibrium and System Optimum with Incomplete Information In Traffic Congestion

  2019cites this paper
• 31 : 2 Wealth Inequality and the Price of Anarchy

  2019cites this paper
• Ordinary and Prophet Planning Under Uncertainty in Bernoulli Congestion Games

  2019cites this paper
• The price of anarchy in routing games as a function of the demand

  2019cites this paper
• Public Signals and Persuasion for Road Network Congestion Games under Vagaries

  2019cites this paper
• Constraint Games for stable and optimal allocation of demands in SDN

  2019cites this paper
• Atomic Routing Game with Capacity Constraints

  2019cites this paper
• Promoting social equity with cyclic tradable credits

  2019cites this paper
• Nonatomic Aggregative Games with Infinitely Many Types

  2019cites this paper
• Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs

  2019cites this paper
• An integrated train service plan optimization model with variable demand: A team-based scheduling approach with dual cost information in a layered network

  2019cites this paper
• When Nash met Markov: Novel results for pure Nash equilibria and the switch Markov chain

  2019influential citation
• Resilience of Traffic Networks with Partially Controlled Routing

  2019cites this paper
• Distributed control and game design: From strategic agents to programmable machines

  2018cites this paper
• Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions

  2018cites this paper
• Risk-Averse Selfish Routing

  2018cites this paper
• Routing for Traffic Networks With Mixed Autonomy

  2018cites this paper
• Nonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players

  2018cites this paper
• One motivation to address the effect of sequential decision making lies in a set of recent publica

  2018cites this paper
• On the Efficiency of Nash Equilibria in Aggregative Charging Games

  2018influential citation
• Toll Caps in Privatized Road Networks

  2018cites this paper
• An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network

  2018cites this paper
• Numerical Bounds on the Price of Anarchy

  2017cites this paper
• Price of anarchy in a linear-state stochastic dynamic game

  2017cites this paper
• Price of Anarchy for Highly Congested Routing Games in Parallel Networks

  2017cites this paper
• Capacity modeling and routing for traffic networks with mixed autonomy

  2017cites this paper
• When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic

  2017cites this paper
• Selfishness Need Not Be Bad

  2017cites this paper
• Multi-scenario optimization approach for assessing the impacts of advanced traffic information under realistic stochastic capacity distributions

  2017cites this paper
• The Asymptotic Behavior of the Price of Anarchy

  2017cites this paper
• Uncertainty in Multi-Commodity Routing Networks: When does it help?

  2017cites this paper
• Models of Competition for Intelligent Transportation Infrastructure: Parking, Ridesharing, and External Factors in Routing Decisions

  2017influential citation
• Constraint Games revisited

  2017cites this paper
• Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game

  2017cites this paper
• Best response dynamics in simultaneous and sequential network design games

  2017cites this paper
• A linear framework for dynamic user equilibrium traffic assignment in a single origin-destination capacitated network

  2017cites this paper
• A Traffic Analysis Perspective on Communication in the Brain

  2017cites this paper
• Capacitated transit service network design with boundedly rational agents

  2016cites this paper
• Nash equilibrium and the price of anarchy in priority based network routing

  2016cites this paper
• Price of anarchy in a dynamic game of environmental management

  2016cites this paper
• Game Theory for Networks: A tutorial on game-theoretic tools for emerging signal processing applications

  2016cites this paper
• On the Price of Anarchy of Highly Congested Nonatomic Network Games

  2016cites this paper
• Dynamic Atomic Congestion Games with Seasonal Flows

  2016cites this paper
• Preferences for travel time under risk and ambiguity: Implications in path selection and network equilibrium

  2016influential citation
• Twenty Lectures on Algorithmic Game Theory

  2016cites this paper
• Population Games and Deterministic Evolutionary Dynamics

  2015cites this paper
• Local smoothness and the price of anarchy in splittable congestion games

  2015cites this paper
• Hybrid Algorithm for Route Design on Bus Rapid Transit Systems

  2015cites this paper
• Learning and Efficiency in Games with Dynamic Population

  2015cites this paper
• Modélisation et optimisation de l'interaction entre véhicules électriques et réseaux d'électricité : apport de la théorie des jeux

  2015cites this paper
• Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing

  2015cites this paper
• Design of National Research Network for Strengthening of Supporting an Advanced Research Activities

  2015cites this paper