SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Game-theoretic routing of GPS-assisted vehicles for energy efficiency
8 references·1 citing·37 second hop
Game-theoretic routing of GPS-assisted vehicles for energy efficiency (2011)Game-theoretic routing of GPS-assisted ve…Stackelberg games and multiple equilibrium behaviors on networks (2007)Stackelberg games and multipl…Stackelberg Scheduling Strategies (2004)Stackelberg Scheduling Strate…The price of anarchy is independent of the network topology (2003)The price of anarchy is indep…The price of anarchy is independent of the network topology (2002)The price of anarchy is indep…Stackelberg scheduling strategies (2001)Stackelberg scheduling strate…Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem (1989)Dynamic Network Traffic Assig…The Fastest Path through a Network with Random Time-Dependent Travel Times (1986)The Fastest Path through a Ne…Traffic assignment problem for a general network (1969)Traffic assignment problem fo…Stackelberg Routing on Parallel Networks With Horizontal Queues (2014)Stackelberg Routing on Parall…Urban transportation networks: Equilibrium analysis with mathematical programming methods (1986)The Traffic Assignment Problem: Models and Methods (1994)Dynamic congestion pricing with day-to-day flow evolution and user heterogeneity (2015)A Mixed User‐Equilibrium and System‐Optimal Traffic Flow for Connected Vehicles Stated as a Complementarity Problem (2017)Mitigating the impact of selfish routing: An optimal-ratio control scheme (ORCS) inspired by autonomous driving (2017)Dynamic Noncooperative Game Theory (1982)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)Studies in the Economics of Transportation. (1956)Studies in the Economics of Transportation. (1957)An efficient approach to solving the road network equilibrium traffic assignment problem (1975)Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems (1994)Sequential Logit Dynamic Travel Demand Model for Hurricane Evacuation (2004)Dynamic traffic assignment: A review of the methodological advances for environmentally sustainable road transportation applications (2018)Dynamic noncooperative game theory (1997)Algorithmic Mechanism Design (2001)Designing Network Protocols for Good Equilibria (2010)Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness (2011)The Economics of Welfare (1933)Tight bounds for worst-case equilibria (2002)Pricing network edges for heterogeneous selfish users (2003)Selfish unsplittable flows (2005)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)Algorithms, games, and the internet (2001)Bounding the inefficiency of equilibria in nonatomic congestion games (2003)Intrinsic robustness of the price of anarchy (2009)Joint Strategy Fictitious Play With Inertia for Potential Games (2009)A probabilistic multipath traffic assignment model which obviates path enumeration (1971)The complexity of pure Nash equilibria (2004)Expected shortest paths in dynamic and stochastic traffic networks (1998)Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks (2000)Shortest path problem considering on-time arrival probability (2009)
this work references cited by second hop

References

  • 1969Traffic assignment problem for a general network688 cited
  • 1989Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem424 cited
  • 1986The Fastest Path through a Network with Random Time-Dependent Travel Times404 cited
  • 2003The price of anarchy is independent of the network topology398 cited
  • 2004Stackelberg Scheduling Strategies215 cited
  • 2002The price of anarchy is independent of the network topology212 cited
  • 2007Stackelberg games and multiple equilibrium behaviors on networks137 cited
  • 2001Stackelberg scheduling strategies132 cited

Cited by

  • 2014Stackelberg Routing on Parallel Networks With Horizontal Queues42 cited

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