Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Algorithms for pure Nash equilibria in weighted congestion games

8 references·3 citing·27 second hop

FromToDepth

this work references cited by second hop

References

1950Equilibrium points in n -person games7,555 cited
1996Potential Games3,617 cited
1973A class of games possessing pure-strategy Nash equilibria2,008 cited
2004The complexity of pure Nash equilibria662 cited
1996Congestion Games with Player-Specific Payoff Functions661 cited
2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game218 cited
2005Selfish unsplittable flows212 cited
2003Nashification and the Coordination Ratio for a Selfish Routing Game107 cited

Cited by

2012Optimal Cost Sharing for Resource Selection Games56 cited
2010On the Existence of Pure Nash Equilibria in Weighted Congestion Games41 cited
2017A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games39 cited

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