Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Strong and Correlated Strong Equilibria in Monotone Congestion Games

8 references·14 citing·40 second hop

FromToDepth

this work references cited by second hop

References

1973A class of games possessing pure-strategy Nash equilibria2,008 cited
1974Subjectivity and correlation in randomized strategies1,630 cited
2001Algorithms, games, and the internet1,107 cited
195916. Acceptable Points in General Cooperative n-Person Games886 cited
2004The Price of Stability for Network Design with Fair Cost Allocation489 cited
1997Strong Equilibrium in Congestion Games200 cited
2005Selfish routing with atomic players71 cited
2003Network structure and strong equilibrium in route selection games68 cited

Cited by

2009Selfish Bin Packing57 cited
2012Optimal Cost Sharing for Resource Selection Games56 cited
2009Strong Nash Equilibria in Games with the Lexicographical Improvement Property54 cited
2009On Strong Equilibria in the Max Cut Game43 cited
2010On the Existence of Pure Nash Equilibria in Weighted Congestion Games41 cited
2009Strong and Pareto Price of Anarchy in Congestion Games38 cited
2012Strong equilibria in games with the lexicographical improvement property37 cited
2008

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

Approximate Strong Equilibrium in Job Scheduling Games

35 cited

2007Routing mediators31 cited

2016Computing the strong Lp− Nash equilibrium for Markov chains games: Convergence and uniqueness30 cited

2007Network formation games with local coalitions28 cited

2012Computing pure Nash and strong equilibria in bottleneck congestion games27 cited

2014Strong equilibrium in network congestion games: increasing versus decreasing costs26 cited

2010Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games25 cited