SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Approximate pure nash equilibria in weighted congestion games
16 references·1 citing·31 second hop
Approximate pure nash equilibria in weighted congestion games (2012)Approximate pure nash equilibria in weigh…Dynamics in near-potential games (2013)Dynamics in near-potential ga…Non-cooperative facility location and covering games (2010)Non-cooperative facility loca…Convergence to approximate Nash equilibria in congestion games (2009)Convergence to approximate Na…Pure Nash equilibria in player-specific and weighted congestion games (2008)Pure Nash equilibria in playe…Online multicast with egalitarian cost sharing (2008)Online multicast with egalita…Inapproximability of pure nash equilibria (2008)Inapproximability of pure nas…Fast convergence to nearly optimal solutions in potential games (2008)Fast convergence to nearly op…Non-Cooperative Multicast and Facility Location Games (2007)Non-Cooperative Multicast and…Convergence time to Nash equilibrium in load balancing (2007)Convergence time to Nash equi…On the Impact of Combinatorial Structure on Congestion Games (2006)On the Impact of Combinatoria…Convergence and Approximation in Potential Games (2006)Convergence and Approximation…Sink Equilibria and Convergence (2005)Sink Equilibria and Convergen…Selfish unsplittable flows (2005)Selfish unsplittable flowsThe complexity of pure Nash equilibria (2004)The complexity of pure Nash e…Convergence Issues in Competitive Games (2004)Convergence Issues in Competi…A class of games possessing pure-strategy Nash equilibria (1973)A class of games possessing p…Dynamic Taxes for Polynomial Congestion Games (2016)Dynamic Taxes for Polynomial …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)Potential Games (1996)Algorithmic Mechanism Design (2001)Fast convergence of selfish rerouting (2005)Almost) optimal coordination mechanisms for unrelated machine scheduling (2008)The Price of Stability for Network Design with Fair Cost Allocation (2004)Equilibrium points in n -person games (1950)Studies in the Economics of Transportation. (1956)Computing Equilibria in Anonymous Games (2007)Distributed algorithms via gradient descent for fisher markets (2011)Non-Cooperative Games (1951)Non-cooperative games (1989)Characterizing the Existence of Potential Functions in Weighted Congestion Games (2011)On the Existence of Pure Nash Equilibria in Weighted Congestion Games (2012)Optimal Cost Sharing for Resource Selection Games (2012)Algorithms, games, and the internet (2001)Computing equilibria: a computational complexity perspective (2009)On the Performance of Approximate Equilibria in Congestion Games (2010)Efficient Computation of Approximate Pure Nash Equilibria in Congestion 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)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)The price of anarchy of finite congestion games (2005)The complexity of computing a Nash equilibrium (2006)
this work references cited by second hop

References

  • 1973A class of games possessing pure-strategy Nash equilibria2,008 cited
  • 2004The complexity of pure Nash equilibria662 cited
  • 2006On the Impact of Combinatorial Structure on Congestion Games245 cited
  • 2005Sink Equilibria and Convergence224 cited
  • 2005Selfish unsplittable flows212 cited
  • 2007Convergence time to Nash equilibrium in load balancing132 cited
  • 2008Fast convergence to nearly optimal solutions in potential games129 cited
  • 2009Convergence to approximate Nash equilibria in congestion games121 cited
  • 2004Convergence Issues in Competitive Games108 cited
  • 2008Inapproximability of pure nash equilibria106 cited
  • 2008Pure Nash equilibria in player-specific and weighted congestion games99 cited
  • 2006Convergence and Approximation in Potential Games90 cited
  • 2013Dynamics in near-potential games80 cited
  • 2007Non-Cooperative Multicast and Facility Location Games68 cited
  • 2008Online multicast with egalitarian cost sharing62 cited
  • 2010Non-cooperative facility location and covering games61 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

  • 2016Dynamic Taxes for Polynomial Congestion Games28 cited