SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Avoiding paradoxes in routing games
12 references·1 citing·36 second hop
Avoiding paradoxes in routing games (2001)Avoiding paradoxes in routing gamesCompetitive routing in multi-user communication networks (2002)Competitive routing in multi-…Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms (2001)Routing into Two Parallel Lin…Braess-like paradoxes in distributed computer systems (2000)Braess-like paradoxes in dist…Capacity allocation under noncooperative routing (1997)Capacity allocation under non…Braess's paradox in a queueing network with state-dependent routing (1997)Braess's paradox in a queuein…Braess's paradox in a loss network (1997)Braess's paradox in a loss ne…Architecting noncooperative networks (1995)Architecting noncooperative n…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…A paradox of congestion in a queuing network (1990)A paradox of congestion in a …On some traffic equilibrium theory paradoxes (1984)On some traffic equilibrium t…In a road network, increasing delay locally can reduce delay globally (1978)In a road network, increasing…Über ein Paradoxon aus der Verkehrsplanung (1968)Über ein Paradoxon aus der Ve…Properties of equilibria in competitive routing with several user types (2004)Properties of equilibria in c…On the Stochastic Matrices Associated with Certain Queuing Processes (1953)Optimality of the shortest line discipline (1977)Simulating computer systems: techniques and tools (1989)The Downs-Thomson Effect in a Markov Process (1997)Inefficiency in stochastic queueing systems with strategic customers (2021)The Prevalence of Braess' Paradox (1983)Inefficiency of Nash Equilibria (1986)Positive value of information in games (2003)Traffic Equilibrium and Variational Inequalities (1980)Competitive routing in networks with polynomial costs (2002)How bad is selfish routing? (2002)An Algorithm for the Discrete Network Design Problem (1975)Loss Networks (1991)Non-cooperative routing in loss networks (2002)Game theory: Analysis of conflict (1992)Design and Analysis of the Progressive Second Price Auction for Network Bandwidth Sharing (1999)Coordination mechanisms (2009)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Optimal static load balancing in distributed computer systems (1985)Inefficient Noncooperation in Networking Games of Common-Pool Resources (2008)Dynamic Noncooperative Game Theory (1982)The price of anarchy is independent of the network topology (2003)A survey on networking games in telecommunications (2004)Games and Decisions (2015)Game theory: analysis of conflict (1992)Achieving network optima using Stackelberg routing strategies (1997)Atomic Resource Sharing in Noncooperative Networks (2001)Stackelberg scheduling strategies (2001)Optimal routing control: repeated game approach (2002)Traffic assignment problem for a general network (1969)Preliminary results in routing games (2001)Distributed selfish load balancing (2006)Atomic congestion games among coalitions (2008)The Economics of Urban Transportation (2007)Trafficking Networks and the Mexican Drug War (2015)Selfish Routing and the Price of Anarchy (2016)
this work references cited by second hop

References

  • 1968Über ein Paradoxon aus der Verkehrsplanung975 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 1995Architecting noncooperative networks241 cited
  • 1990A paradox of congestion in a queuing network162 cited
  • 1984On some traffic equilibrium theory paradoxes159 cited
  • 1997Capacity allocation under noncooperative routing148 cited
  • 2000Braess-like paradoxes in distributed computer systems72 cited
  • 1997Braess's paradox in a loss network70 cited
  • 1997Braess's paradox in a queueing network with state-dependent routing63 cited
  • 2002Competitive routing in multi-user communication networks63 cited
  • 2001Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms54 cited
  • 1978In a road network, increasing delay locally can reduce delay globally46 cited

Cited by

  • 2004Properties of equilibria in competitive routing with several user types7 cited

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