SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
16 references·4 citing·31 second hop
Stackelberg Strategies and Collusion in Network Games with Splittable Flow (2010)Stackelberg Strategies and Collusion in N…Selfish Routing and the Price of Anarchy (2016)Selfish Routing and the Price…The Impact of Oligopolistic Competition in Networks (2009)The Impact of Oligopolistic C…The effect of collusion in congestion games (2006)The effect of collusion in co…Selfish Routing and the Price of Anarchy (2006)Selfish Routing and the Price…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…Stackelberg Scheduling Strategies (2004)Stackelberg Scheduling Strate…Selfish Routing in Capacitated Networks (2004)Selfish Routing in Capacitate…The price of anarchy is independent of the network topology (2003)The price of anarchy is indep…Competitive routing in networks with polynomial costs (2002)Competitive routing in networ…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…On the relationship between Nash—Cournot and Wardrop equilibria (1985)On the relationship between N…Traffic assignment problem for a general network (1969)Traffic assignment problem fo…Über ein Paradoxon aus der Verkehrsplanung (1968)Über ein Paradoxon aus der Ve…Risk-Averse Selfish Routing (2018)Risk-Averse Selfish RoutingBounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands (2014)Bounding the inefficiency of …The effectiveness of stackelberg strategies and tolls for network congestion games (2012)The effectiveness of stackelb…The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds (2010)The Limits of Smoothness: A P…Equilibrium points in n -person games (1950)A class of games possessing pure-strategy Nash equilibria (1973)Sink Equilibria and Convergence (2005)Coordination mechanisms (2009)Intrinsic robustness of the price of anarchy (2009)A Course in Game Theory (1994)Potential Games (1996)The Economics of Welfare (1933)Non-cooperative games (1989)Game Theory in Wireless Networks: A Tutorial (2006)Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation (2012)Distributed Welfare Games (2013)Studies in the Economics of Transportation. (1956)Studies in the Economics of Transportation. (1957)The Price of Stability for Network Design with Fair Cost Allocation (2004)The Price of Stability for Network Design with Fair Cost Allocation (2008)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Dynamic Noncooperative Game Theory (1982)A survey on networking games in telecommunications (2004)Games and Decisions (2015)Algorithms, games, and the internet (2001)Bounding the inefficiency of equilibria in nonatomic congestion games (2003)Joint Strategy Fictitious Play With Inertia for Potential Games (2009)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)The Economics of Urban Transportation (2007)Trafficking Networks and the Mexican Drug War (2015)A probabilistic multipath traffic assignment model which obviates path enumeration (1971)Traffic Equilibrium and Variational Inequalities (1980)The complexity of pure Nash equilibria (2004)Service Science, Management, Engineering, and Design (SSMED) (2009)
this work references cited by second hop

References

  • 1999Worst-Case Equilibria1,962 cited
  • 1968Über ein Paradoxon aus der Verkehrsplanung975 cited
  • 1969Traffic assignment problem for a general network688 cited
  • 2006Selfish Routing and the Price of Anarchy686 cited
  • 2016Selfish Routing and the Price of Anarchy647 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 2005The price of anarchy of finite congestion games452 cited
  • 2003The price of anarchy is independent of the network topology398 cited
  • 2004Selfish Routing in Capacitated Networks388 cited
  • 2005The Price of Routing Unsplittable Flow354 cited
  • 1985On the relationship between Nash—Cournot and Wardrop equilibria328 cited
  • 1997Achieving network optima using Stackelberg routing strategies316 cited
  • 2004Stackelberg Scheduling Strategies215 cited
  • 2002Competitive routing in networks with polynomial costs213 cited
  • 2009The Impact of Oligopolistic Competition in Networks117 cited
  • 2006The effect of collusion in congestion games114 cited

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

Cited by

  • 2012The effectiveness of stackelberg strategies and tolls for network congestion games45 cited
  • 2010The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds32 cited
  • 2014Bounding the inefficiency of atomic splittable selfish traffic equilibria with elastic demands5 cited
  • 2018Risk-Averse Selfish Routing5 cited