SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Competitive routing over time
16 references·2 citing·31 second hop
Competitive routing over time (2011)Competitive routing over timeMultiplicative updates outperform generic no-regret learning in congestion games (2009)Multiplicative updates outper…Intrinsic robustness of the price of anarchy (2009)Intrinsic robustness of the p…Coordination mechanisms (2009)Coordination mechanismsStrong price of anarchy (2008)Strong price of anarchyCoordination mechanisms for selfish scheduling (2008)Coordination mechanisms for s…On the Impact of Combinatorial Structure on Congestion Games (2006)On the Impact of Combinatoria…The Price of Routing Unsplittable Flow (2005)The Price of Routing Unsplitt…The price of anarchy of finite congestion games (2005)The price of anarchy of finit…The complexity of pure Nash equilibria (2004)The complexity of pure Nash e…Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future (2001)Foundations of Dynamic Traffi…Strong Equilibrium in Congestion Games (1997)Strong Equilibrium in Congest…Potential Games (1996)Potential GamesA new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks (1993)A new dynamic traffic model a…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…16. Acceptable Points in General Cooperative n-Person Games (1959)16. Acceptable Points in Gene…A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows (2022)A finite time combinatorial a…A Stackelberg strategy for routing flow over time (2013)A Stackelberg strategy for ro…Studies in the Economics of Transportation. (1956)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 Price of Stability for Network Design with Fair Cost Allocation (2004)Fast convergence to nearly optimal solutions in potential games (2008)Convergence to approximate Nash equilibria in congestion games (2009)Intrinsic Robustness of the Price of Anarchy (2015)Equilibrium points in n -person games (1950)Worst-Case Equilibria (1999)Sink Equilibria and Convergence (2005)A Course in Game Theory (1994)Prediction, Learning, and Games (2006)Algorithmic game theory (2010)Composable and efficient mechanisms (2013)Distributed Welfare Games (2013)Theory of Games and Economic Behavior (1947)Equilibrium in supergames with the overtaking criterion (1979)Optimal Incentive Schemes with Many Agents (1984)Comments on the Interpretation of Game Theory (1991)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Evolutionary Game Theory (2011)The complexity of computing a Nash equilibrium (2006)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)Evolutionary game dynamics (2003)Evolutionary games on graphs (2007)
this work references cited by second hop

References

  • 1996Potential Games3,617 cited
  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1969CONGESTION THEORY AND TRANSPORT INVESTMENT1,981 cited
  • 195916. Acceptable Points in General Cooperative n-Person Games886 cited
  • 2001Foundations of Dynamic Traffic Assignment: The Past, the Present and the Future788 cited
  • 2004The complexity of pure Nash equilibria662 cited
  • 2005The price of anarchy of finite congestion games452 cited
  • 2005The Price of Routing Unsplittable Flow354 cited
  • 2009Intrinsic robustness of the price of anarchy333 cited
  • 2006On the Impact of Combinatorial Structure on Congestion Games245 cited
  • 2009Coordination mechanisms203 cited
  • 1997Strong Equilibrium in Congestion Games200 cited
  • 2008Strong price of anarchy171 cited
  • 1993A new dynamic traffic model and the existence and calculation of dynamic user equilibria on congested capacity-constrained road networks170 cited
  • 2008Coordination mechanisms for selfish scheduling144 cited
  • 2009Multiplicative updates outperform generic no-regret learning in congestion games

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

133 cited

Cited by

  • 2013A Stackelberg strategy for routing flow over time34 cited
  • 2022A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows4 cited