this work references cited by second hopReferences
- 1950Equilibrium points in n -person games7,555 cited
- 1951Non-Cooperative Games6,999 cited
- 1989Non-cooperative games5,594 cited
- 1994A Course in Game Theory5,468 cited
- 1999Worst-Case Equilibria1,962 cited
- 2001Algorithms, games, and the internet1,107 cited
- 2003Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions320 cited
- 1978Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon230 cited
- 2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game218 cited
- 2002Tight bounds for worst-case equilibria195 cited
- 2003Approximate Equilibria and Ball Fusion133 cited
- 2002On the complexity of equilibria133 cited
- 2003Nashification and the Coordination Ratio for a Selfish Routing Game107 cited
- 2003Universality of Nash Equilibria47 cited
- 2003Which Is the Worst-Case Nash Equilibrium?47 cited
- 1970Completely Mixed Strategies in Bimatrix Games46 cited
Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work