Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Pure Nash equilibria in player-specific and weighted congestion games

8 references·4 citing·30 second hop

FromToDepth

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
1996Congestion Games with Player-Specific Payoff Functions661 cited
2004The Price of Stability for Network Design with Fair Cost Allocation487 cited
2006On the Impact of Combinatorial Structure on Congestion Games245 cited
2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game218 cited
2005Selfish unsplittable flows212 cited
2005Fast and compact: a simple class of congestion games126 cited

Cited by

2011Characterizing the Existence of Potential Functions in Weighted Congestion Games69 cited
2012Optimal Cost Sharing for Resource Selection Games56 cited
2009Strong Nash Equilibria in Games with the Lexicographical Improvement Property54 cited
2010On the Existence of Pure Nash Equilibria in Weighted Congestion Games41 cited

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