SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Exact Price of Anarchy for Polynomial Congestion Games
10 references·10 citing·36 second hop
Exact Price of Anarchy for Polynomial Congestion Games (2011)Exact Price of Anarchy for Polynomial Con…The Impact of Oligopolistic Competition in Networks (2009)The Impact of Oligopolistic C…Tight bounds for worst-case equilibria (2007)Tight bounds for worst-case e…Selfish unsplittable flows (2005)Selfish unsplittable flowsBounding the inefficiency of equilibria in nonatomic congestion games (2003)Bounding the inefficiency of …Approximate Equilibria and Ball Fusion (2003)Approximate Equilibria and Ba…Atomic Resource Sharing in Noncooperative Networks (2001)Atomic Resource Sharing in No…Potential Games (1996)Potential GamesCongestion Games with Player-Specific Payoff Functions (1996)Congestion Games with Player-…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…Non-Cooperative Games (1951)Non-Cooperative GamesPrice of anarchy of traffic assignment with exponential cost functions (2023)Price of anarchy of traffic a…A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games (2017)A Unifying Tool for Bounding …Price of Stability in Polynomial Congestion Games (2015)Price of Stability in Polynom…Learning and Efficiency in Games with Dynamic Population (2015)Learning and Efficiency in Ga…Weighted Congestion Games (2014)Weighted Congestion GamesLocal smoothness and the price of anarchy in splittable congestion games (2014)Local smoothness and the pric…Barriers to Near-Optimal Equilibria (2014)Barriers to Near-Optimal Equi…The Price of Routing Unsplittable Flow (2013)The Price of Routing Unsplitt…Optimal Cost Sharing for Resource Selection Games (2012)Optimal Cost Sharing for Reso…Intrinsic robustness of the price of anarchy (2012)Intrinsic robustness of the p…Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Non-cooperative games (1989)A Course in Game Theory (1994)Exact Price of Anarchy for Polynomial Congestion Games (2006)Selfish Load Balancing (2007)Regret minimization and the price of total anarchy (2008)Game theory: analysis of conflict (1992)Competitive routing in multiuser communication networks (1993)Achieving network optima using Stackelberg routing strategies (1997)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2012)Worst-Case Equilibria (1999)On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, (2005)Convergence time to Nash equilibrium in load balancing (2007)Evolution and the Theory of Games (1988)Learning, Mutation, and Long Run Equilibria in Games (1993)The Evolution of Conventions (1993)The complexity of pure Nash equilibria (2004)The price of anarchy of finite congestion games (2005)The Economics of Welfare (1933)The Theory of Industrial Organization (1988)Theory of Industrial Organization. (1989)Local smoothness and the price of anarchy in atomic splittable congestion games (2011)Optimal Cost-Sharing in General Resource Selection Games (2016)Routing without regret (2006)Approximating Congestion + Dilation in Networks via "Quality of Routing” Games (2011)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Evolutionary Game Theory (2011)The price of anarchy is independent of the network topology (2002)Computing correlated equilibria in multi-player games (2008)Social Optima in Mean Field LQG Control: Centralized and Decentralized Strategies (2012)Evolutionary game dynamics (2003)Evolutionary games on graphs (2007)Subjectivity and correlation in randomized strategies (1974)Covenants with and without a Sword: Self-Governance Is Possible (1992)A theory of sequential reciprocity (2003)
this work references cited by second hop

References

  • 1951Non-Cooperative Games6,999 cited
  • 1996Potential Games3,617 cited
  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1996Congestion Games with Player-Specific Payoff Functions661 cited
  • 2003Bounding the inefficiency of equilibria in nonatomic congestion games300 cited
  • 2005Selfish unsplittable flows212 cited
  • 2007Tight bounds for worst-case equilibria161 cited
  • 2003Approximate Equilibria and Ball Fusion133 cited
  • 2001Atomic Resource Sharing in Noncooperative Networks120 cited
  • 2009The Impact of Oligopolistic Competition in Networks117 cited

Cited by

  • 2014Barriers to Near-Optimal Equilibria70 cited
  • 2013The Price of Routing Unsplittable Flow66 cited
  • 2014Weighted Congestion Games62 cited
  • 2014Local smoothness and the price of anarchy in splittable congestion games61 cited
  • 2012Optimal Cost Sharing for Resource Selection Games56 cited
  • 2015Learning and Efficiency in Games with Dynamic Population56 cited

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

  • 2012Intrinsic robustness of the price of anarchy44 cited
  • 2015Price of Stability in Polynomial Congestion Games41 cited
  • 2017A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games39 cited
  • 2023Price of anarchy of traffic assignment with exponential cost functions6 cited