SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Capacity allocation under noncooperative routing
4 references·16 citing·45 second hop
Capacity allocation under noncooperative routing (1997)Capacity allocation under noncooperative …Achieving network optima using Stackelberg routing strategies (1997)Achieving network optima usin…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…Game theory: analysis of conflict (1992)Game theory: analysis of conf…A paradox of congestion in a queuing network (1990)A paradox of congestion in a …Bibliometric analysis and systematic literature review of the traffic paradoxes (1968–2022) (2023)Bibliometric analysis and sys…Optimal Parameters of Service in a Public Transportation Market with Pricing (2020)Optimal Parameters of Service…Stackelberg Routing on Parallel Networks With Horizontal Queues (2014)Stackelberg Routing on Parall…Equilibrium Traffic Flow Assignment in Case of Two Navigation Providers (2013)Equilibrium Traffic Flow Assi…Integrated-Equilibrium Routing of Traffic Flows with Congestion (2008)Integrated-Equilibrium Routin…Aligning social welfare and agent preferences to alleviate traffic congestion (2008)Aligning social welfare and a…Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users (2007)Topological Uniqueness of the…Selfish Routing on the Internet. (2004)Selfish Routing on the Intern…Properties of equilibria in competitive routing with several user types (2004)Properties of equilibria in c…Avoiding paradoxes in multi-agent competitive routing (2003)Avoiding paradoxes in multi-a…Selfish traffic allocation for server farms (2002)Selfish traffic allocation fo…Optimal routing control: repeated game approach (2002)Optimal routing control: repe…Stackelberg scheduling strategies (2001)Stackelberg scheduling strate…Preliminary results in routing games (2001)Preliminary results in routin…Avoiding paradoxes in routing games (2001)Avoiding paradoxes in routing…Atomic Resource Sharing in Noncooperative Networks (2001)Atomic Resource Sharing in No…Dynamic Noncooperative Game Theory (1982)Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)Worst-Case Equilibria (1999)When selfish meets evil (2006)An efficient heuristic approach for security against multiple adversaries (2007)Learning and Approximating the Optimal Strategy to Commit To (2009)Über ein Paradoxon aus der Verkehrsplanung (1968)The Prevalence of Braess' Paradox (1983)Inefficiency of Nash Equilibria (1986)Braess's paradox in a loss network (1997)Braess-like paradoxes in distributed computer systems (2000)Positive value of information in games (2003)Queueing Systems. Volume 1: Theory (1975)Fundamentals of Queueing Theory. (1977)Personal communication (1989)Fast convergence of selfish rerouting (2005)On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (2006)Tradeoffs in worst-case equilibria (2006)Traffic assignment problem for a general network (1969)Traffic Equilibrium and Variational Inequalities (1980)A study of general and security Stackelberg game formulations (2019)Bridging the user equilibrium and the system optimum in static traffic assignment: how the cooperation among drivers can solve the congestion problem in city networks (2021)TASR: A Novel Trust-Aware Stackelberg Routing Algorithm to Mitigate Traffic Congestion (2024)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)The price of anarchy is independent of the network topology (2003)A survey on networking games in telecommunications (2004)Games and Decisions (2015)A Social Equilibrium Existence Theorem* (1952)Studies in the Economics of Transportation. (1956)The Equilibrium Existence Problem in Finite Network Congestion Games (2006)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2010)Fragility of the commons under prospect-theoretic risk attitudes (2016)A Non-cooperative Equilibrium for Supergames (1971)The Folk Theorem in Repeated Games with Discounting or with Incomplete Information (1986)Self-Interested Routing in Queueing Networks (2004)Bottleneck Routing Games in Communication Networks (2007)Selfish Load Balancing (2007)Exact Price of Anarchy for Polynomial Congestion Games (2011)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2012)The Theory of Incentives: The Principal-Agent Model (2001)Culture and Institutions: Economic Development in the Regions of Europe (2010)The Politics of Authoritarian Rule (2012)Architecting noncooperative networks (1995)Stackelberg Scheduling Strategies (2004)Competition and Efficiency in Congested Markets (2007)
this work references cited by second hop

References

  • 1992Game theory: analysis of conflict3,325 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 1997Achieving network optima using Stackelberg routing strategies316 cited
  • 1990A paradox of congestion in a queuing network162 cited

Cited by

  • 2001Stackelberg scheduling strategies132 cited
  • 2001Atomic Resource Sharing in Noncooperative Networks120 cited
  • 2002Optimal routing control: repeated game approach102 cited
  • 2002Selfish traffic allocation for server farms97 cited
  • 2007Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users44 cited
  • 2014Stackelberg Routing on Parallel Networks With Horizontal Queues42 cited
  • 2004Selfish Routing on the Internet.41 cited
  • 2001Preliminary results in routing games40 cited
  • 2008Aligning social welfare and agent preferences to alleviate traffic congestion38 cited
  • 2003Avoiding paradoxes in multi-agent competitive routing17 cited
  • 2013Equilibrium Traffic Flow Assignment in Case of Two Navigation Providers10 cited
  • 2023

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

Bibliometric analysis and systematic literature review of the traffic paradoxes (1968–2022)
9 cited
  • 2001Avoiding paradoxes in routing games9 cited
  • 2020Optimal Parameters of Service in a Public Transportation Market with Pricing7 cited
  • 2008Integrated-Equilibrium Routing of Traffic Flows with Congestion7 cited
  • 2004Properties of equilibria in competitive routing with several user types7 cited