SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
9 references·2 citing·29 second hop
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (2012)Improved Lower Bounds on the Price of Sta…On the Value of Coordination in Network Design (2009)On the Value of Coordination …An upper bound on the price of stability for undirected Shapley network design games (2009)An upper bound on the price o…The Price of Stability for Network Design with Fair Cost Allocation (2008)The Price of Stability for Ne…Network Design with Weighted Players (2008)Network Design with Weighted …On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (2006)On the Price of Stability for…On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,, (2005)On the Price of Anarchy and S…Algorithms, games, and the internet (2001)Algorithms, games, and the in…Worst-Case Equilibria (1999)Worst-Case EquilibriaA class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…The Price of Stability of Weighted Congestion Games (2019)The Price of Stability of Wei…Price of Stability in Polynomial Congestion Games (2015)Price of Stability in Polynom…Equilibrium points in n -person games (1950)Potential Games (1996)Non-Cooperative Multicast and Facility Location Games (2007)Strong Price of Anarchy for Machine Load Balancing (2007)Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games (2014)The Price of Stability for Network Design with Fair Cost Allocation (2004)On the Price of Stability for Undirected Network Design (2010)On the performance of user equilibrium in traffic networks (2011)The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant (2013)A Noncooperative Model of Network Formation (2000)On the Performance of Approximate Equilibria in Congestion Games (2010)Algorithmic Mechanism Design (2001)Intrinsic robustness of the price of anarchy (2009)Intrinsic Robustness of the Price of Anarchy (2015)Twenty Lectures on Algorithmic Game Theory (2016)A Course in Game Theory (1994)The effect of collusion in congestion games (2006)Regret minimization and the price of total anarchy (2008)The price of anarchy in games of incomplete information (2012)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Designing Network Protocols for Good Equilibria (2010)Non-cooperative facility location and covering games (2010)Characterizing the Existence of Potential Functions in Weighted Congestion Games (2011)Equilibrium Points in Nonzero-Sum n -Person Submodular Games (1979)Evolutionary Game Theory (2011)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)Worst-case equilibria (2009)A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games (2017)
this work references cited by second hop

References

  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 1999Worst-Case Equilibria1,962 cited
  • 2001Algorithms, games, and the internet1,107 cited
  • 2008The Price of Stability for Network Design with Fair Cost Allocation532 cited
  • 2005On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,162 cited
  • 2008Network Design with Weighted Players112 cited
  • 2009On the Value of Coordination in Network Design92 cited
  • 2006On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations91 cited
  • 2009An upper bound on the price of stability for undirected Shapley network design games60 cited

Cited by

  • 2015Price of Stability in Polynomial Congestion Games41 cited
  • 2019The Price of Stability of Weighted Congestion Games31 cited

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