SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Stackelberg Strategies for Atomic Congestion Games
13 references·4 citing·38 second hop
Stackelberg Strategies for Atomic Congestion Games (2008)Stackelberg Strategies for Atomic Congest…A new model for selfish routing (2008)A new model for selfish routi…Selfish Load Balancing and Atomic Congestion Games (2006)Selfish Load Balancing and At…Exact Price of Anarchy for Polynomial Congestion Games (2006)Exact Price of Anarchy for Po…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…Nash Equilibria in Discrete Routing Games with Convex Latency Functions (2004)Nash Equilibria in Discrete R…A New Model for Selfish Routing (2004)A New Model for Selfish Routi…The price of anarchy is independent of the network topology (2003)The price of anarchy is indep…Worst-Case Equilibria (1999)Worst-Case EquilibriaAchieving network optima using Stackelberg routing strategies (1997)Achieving network optima usin…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games (2017)A Unifying Tool for Bounding …Dynamic Taxes for Polynomial Congestion Games (2016)Dynamic Taxes for Polynomial …The effectiveness of stackelberg strategies and tolls for network congestion games (2012)The effectiveness of stackelb…Stackelberg Strategies and Collusion in Network Games with Splittable Flow (2010)Stackelberg Strategies and Co…Equilibrium points in n -person games (1950)Non-Cooperative Games (1951)Non-cooperative games (1989)Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions (2006)Price of Anarchy (2008)On the Performance of Approximate Equilibria in Congestion Games (2010)A Course in Game Theory (1994)Potential Games (1996)Traffic assignment problem for a general network (1969)Dynamic noncooperative game theory (1997)Algorithmic Mechanism Design (2001)An efficient heuristic approach for security against multiple adversaries (2007)Designing Network Protocols for Good Equilibria (2010)Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness (2011)Algorithms, games, and the internet (2001)Taxes for linear atomic congestion games (2010)The Price of Routing Unsplittable Flow (2013)Weighted Congestion Games (2014)The Economics of Welfare (1933)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)Selfish Routing and the Price of Anarchy (2016)Inefficiency of Nash Equilibria (1986)Game theory: analysis of conflict (1992)Competitive routing in multiuser communication networks (1993)Architecting noncooperative networks (1995)Competition and Efficiency in Congested Markets (2007)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Sink Equilibria and Convergence (2005)Coordination mechanisms (2009)Intrinsic robustness of the price of anarchy (2009)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Evolutionary Game Theory (2011)Bounding the inefficiency of equilibria in nonatomic congestion games (2003)Joint Strategy Fictitious Play With Inertia for Potential Games (2009)
this work references cited by second hop

References

  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1999Worst-Case Equilibria1,962 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
  • 1997Achieving network optima using Stackelberg routing strategies316 cited
  • 2004Stackelberg Scheduling Strategies215 cited
  • 2006Selfish Load Balancing and Atomic Congestion Games128 cited
  • 2006Exact Price of Anarchy for Polynomial Congestion Games99 cited
  • 2004A New Model for Selfish Routing57 cited
  • 2008A new model for selfish routing55 cited
  • 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functions55 cited

Cited by

  • 2010Stackelberg Strategies and Collusion in Network Games with Splittable Flow45 cited
  • 2012The effectiveness of stackelberg strategies and tolls for network congestion games45 cited
  • 2017A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games

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

39 cited
  • 2016Dynamic Taxes for Polynomial Congestion Games28 cited