SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
16 references·1 citing·33 second hop
On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2010)On the Existence of Pure Nash Equilibria …Intrinsic robustness of the price of anarchy (2009)Intrinsic robustness of the p…The Price of Stability for Network Design with Fair Cost Allocation (2008)The Price of Stability for Ne…Strong price of anarchy (2008)Strong price of anarchyNetwork Design with Weighted Players (2008)Network Design with Weighted …Convergence time to Nash equilibrium in load balancing (2007)Convergence time to Nash equi…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…Sink Equilibria and Convergence (2005)Sink Equilibria and Convergen…Selfish unsplittable flows (2005)Selfish unsplittable flowsFast and compact: a simple class of congestion games (2005)Fast and compact: a simple cl…The Price of Stability for Network Design with Fair Cost Allocation (2004)The Price of Stability for Ne…Atomic Resource Sharing in Noncooperative Networks (2001)Atomic Resource Sharing in No…Congestion Games with Player-Specific Payoff Functions (1996)Congestion Games with Player-…Competitive routing in multiuser communication networks (1993)Competitive routing in multiu…The network equilibrium problem in integers (1973)The network equilibrium probl…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 …On the Strategic Stability of Equilibria (1986)Learning, Mutation, and Long Run Equilibria in Games (1993)Worst-Case Equilibria (1999)Flows and Decompositions of Games: Harmonic and Potential Games (2011)Intrinsic Robustness of the Price of Anarchy (2015)Twenty Lectures on Algorithmic Game Theory (2016)Equilibrium points in n -person games (1950)Coordination mechanisms (2009)A Course in Game Theory (1994)Potential Games (1996)A Noncooperative Model of Network Formation (2000)Algorithmic Mechanism Design (2001)Evolution and the Theory of Games (1988)The Evolution of Conventions (1993)The complexity of pure Nash equilibria (2004)Computing correlated equilibria in multi-player games (2008)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)Dynamic Noncooperative Game Theory (1982)Achieving network optima using Stackelberg routing strategies (1997)The price of anarchy is independent of the network topology (2003)A survey on networking games in telecommunications (2004)Games and Decisions (2015)Prediction, Learning, and Games (2006)Algorithmic game theory (2010)Composable and efficient mechanisms (2013)Distributed Welfare Games (2013)Studies in the Economics of Transportation. (1956)On the Impact of Combinatorial Structure on Congestion Games (2006)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Evolutionary Game Theory (2011)On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, (2005)Approximating Congestion + Dilation in Networks via "Quality of Routing” Games (2011)
this work references cited by second hop

References

  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1996Congestion Games with Player-Specific Payoff Functions661 cited
  • 1993Competitive routing in multiuser communication networks555 cited
  • 2008The Price of Stability for Network Design with Fair Cost Allocation532 cited
  • 2004The Price of Stability for Network Design with Fair Cost Allocation487 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
  • 2005Sink Equilibria and Convergence224 cited
  • 2005Selfish unsplittable flows212 cited
  • 2008Strong price of anarchy171 cited
  • 1973The network equilibrium problem in integers141 cited
  • 2007Convergence time to Nash equilibrium in load balancing132 cited
  • 2005Fast and compact: a simple class of congestion games126 cited
  • 2001Atomic Resource Sharing in Noncooperative Networks120 cited
  • 2008Network Design with Weighted Players112 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

  • 2017A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games39 cited