Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Convergence and Approximation in Potential Games

10 references·13 citing·29 second hop

FromToDepth

this work references cited by second hop

References

1996Potential Games3,617 cited
1973A class of games possessing pure-strategy Nash equilibria2,008 cited
2001Algorithms, games, and the internet1,107 cited
2004The complexity of pure Nash equilibria662 cited
2005The price of anarchy of finite congestion games452 cited
2005The Price of Routing Unsplittable Flow354 cited
2005Sink Equilibria and Convergence224 cited
2005Selfish unsplittable flows212 cited
2005On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games,,162 cited
2004Convergence Issues in Competitive Games108 cited

Cited by

2011Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games54 cited
2012Convergence and approximation in potential games46 cited
2009On Strong Equilibria in the Max Cut Game43 cited
2012Efficient Coordination Mechanisms for Unrelated Machine Scheduling42 cited
2010Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games41 cited
2009Improved equilibria via public service advertising

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

40 cited

2013Near-Potential Games39 cited

2009Efficient coordination mechanisms for unrelated machine scheduling38 cited

2008The Speed of Convergence in Congestion Games under Best-Response Dynamics33 cited

2008Atomic Congestion Games: Fast, Myopic and Concurrent32 cited

2010Graphical Congestion Games31 cited

2012Approximate pure nash equilibria in weighted congestion games29 cited

2013A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games29 cited