SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks
7 references·3 citing·34 second hop
How harmful the paradox can be in the Braess/Cohen-Kelly-Jeffries networks (2003)How harmful the paradox can be in the Bra…Architecting noncooperative networks (1995)Architecting noncooperative n…The Traffic Assignment Problem: Models and Methods (1994)The Traffic Assignment Proble…A paradox of congestion in a queuing network (1990)A paradox of congestion in a …Sensitivity analysis for the asymmetric network equilibrium problem (1984)Sensitivity analysis for the …The Prevalence of Braess' Paradox (1983)The Prevalence of Braess' Par…Braess's paradox of traffic flow (1970)Braess's paradox of traffic f…Über ein Paradoxon aus der Verkehrsplanung (1968)Über ein Paradoxon aus der Ve…Inefficiency in stochastic queueing systems with strategic customers (2021)Inefficiency in stochastic qu…Coincident Cost Improvement vs. Degradation by Adding Connections to Noncooperative Networks and Distributed Systems (2009)Coincident Cost Improvement v…Bottleneck Routing Games in Communication Networks (2007)Bottleneck Routing Games in C…The existence, uniqueness and stability of traffic equilibria (1979)Traffic Equilibrium and Variational Inequalities (1980)Oligopolistic and competitive behavior of spatially separated markets (1987)Pricing network edges for heterogeneous selfish users (2003)Inefficiency of Nash Equilibria (1986)Capacity allocation under noncooperative routing (1997)Braess-like paradoxes in distributed computer systems (2000)Positive value of information in games (2003)Studies in the Economics of Transportation. (1956)Studies in the Economics of Transportation. (1957)Braess' paradox: Some new insights (1997)An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model (1998)How bad is selfish routing? (2002)Worst-Case Equilibria (1999)Algorithms, games, and the internet (2001)Game theory: Analysis of conflict (1992)Competitive routing in multiuser communication networks (1993)Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing (1999)Competitive routing in networks with polynomial costs (2002)Coordination mechanisms (2009)A Social Equilibrium Existence Theorem* (1952)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Atomic routing games on maximum congestion (2009)Strong Nash Equilibria in Games with the Lexicographical Improvement Property (2009)The Regulation of Queue Size by Levying Tolls (1969)To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems (2003)Strategic customer behavior and optimal policies in a passenger–taxi double-ended queueing system with multiple access points and nonzero matching times (2022)The Economics of Urban Transportation (2007)Trafficking Networks and the Mexican Drug War (2015)Selfish Routing and the Price of Anarchy (2016)Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)The multi-class, multi-criteria traffic network equilibrium and systems optimum problem (2003)A survey on networking games in telecommunications (2004)Transportation network equilibrium, design and aggregation: Key developments and research opportunities (1985)
this work references cited by second hop

References

  • 1994The Traffic Assignment Problem: Models and Methods1,043 cited
  • 1968Über ein Paradoxon aus der Verkehrsplanung975 cited
  • 1995Architecting noncooperative networks241 cited
  • 1983The Prevalence of Braess' Paradox232 cited
  • 1970Braess's paradox of traffic flow210 cited
  • 1990A paradox of congestion in a queuing network162 cited
  • 1984Sensitivity analysis for the asymmetric network equilibrium problem145 cited

Cited by

  • 2007Bottleneck Routing Games in Communication Networks99 cited
  • 2021Inefficiency in stochastic queueing systems with strategic customers23 cited
  • 2009Coincident Cost Improvement vs. Degradation by Adding Connections to Noncooperative Networks and Distributed Systems9 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work