SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A Stackelberg strategy for routing flow over time
16 references·3 citing·27 second hop
A Stackelberg strategy for routing flow over time (2013)A Stackelberg strategy for routing flow o…Selfish Routing and the Price of Anarchy (2016)Selfish Routing and the Price…Selfish Routing and the Price of Anarchy (2006)Selfish Routing and the Price…Stackelberg Scheduling Strategies (2004)Stackelberg Scheduling Strate…Selfish Routing in Capacitated Networks (2004)Selfish Routing in Capacitate…Efficiency Loss in a Network Resource Allocation Game (2004)Efficiency Loss in a Network …On a network creation game (2003)On a network creation gameFoundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)Foundations of Dynamic Traffi…Algorithms, games, and the internet (2001)Algorithms, games, and the in…Worst-Case Equilibria (1999)Worst-Case EquilibriaAchieving network optima using Stackelberg routing strategies (1997)Achieving network optima usin…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…CONGESTION THEORY AND TRANSPORT INVESTMENT (1969)CONGESTION THEORY AND TRANSPO…Studies in the Economics of Transportation. (1957)Studies in the Economics of T…Studies in the Economics of Transportation. (1956)Studies in the Economics of T…Marktform und Gleichgewicht. (1935)Marktform und Gleichgewicht.Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time (2022)Continuity, Uniqueness and Lo…Dynamic Atomic Congestion Games with Seasonal Flows (2018)Dynamic Atomic Congestion Gam…Backward induction algorithm for a class of closed-loop Stackelberg games (2014)Backward induction algorithm …Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)The Traffic Assignment Problem: Models and Methods (1994)System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion (2005)Robust optimization for emergency logistics planning: Risk mitigation in humanitarian relief supply chains (2010)Line planning in public transportation: models and methods (2011)The Economics of Welfare (1933)Non-cooperative games (1989)A Course in Game Theory (1994)Game Theory in Wireless Networks: A Tutorial (2006)Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation (2012)Distributed Welfare Games (2013)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Evolutionary Game Theory (2011)Traffic Equilibrium and Variational Inequalities (1980)THEORIES OF THE FIRM: MARGINALIST, BEHAVIORAL, MANAGERIAL (1978)The Theory of Business Strategy (1989)Computing the optimal strategy to commit to (2006)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)Worst-case equilibria (2009)A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem (1993)The valuation of reliability for personal travel (2001)The Economics of Urban Transportation (2007)An efficient approach to solving the road network equilibrium traffic assignment problem (1975)The existence, uniqueness and stability of traffic equilibria (1979)Service Science, Management, Engineering, and Design (SSMED) (2009)
this work references cited by second hop

References

  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1969CONGESTION THEORY AND TRANSPORT INVESTMENT1,981 cited
  • 1999Worst-Case Equilibria1,962 cited
  • 1956Studies in the Economics of Transportation.1,614 cited
  • 1957Studies in the Economics of Transportation.1,489 cited
  • 2001Algorithms, games, and the internet1,107 cited
  • 1935Marktform und Gleichgewicht.1,037 cited
  • 2001Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future788 cited
  • 2006Selfish Routing and the Price of Anarchy686 cited
  • 2016Selfish Routing and the Price of Anarchy647 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 2004Efficiency Loss in a Network Resource Allocation Game537 cited
  • 2003On a network creation game523 cited
  • 2004Selfish Routing in Capacitated Networks388 cited
  • 1997Achieving network optima using Stackelberg routing strategies316 cited
  • 2004Stackelberg Scheduling Strategies215 cited

Cited by

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

  • 2014Backward induction algorithm for a class of closed-loop Stackelberg games31 cited
  • 2018Dynamic Atomic Congestion Games with Seasonal Flows30 cited
  • 2022Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time3 cited