SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Which Is the Worst-Case Nash Equilibrium?
11 references·1 citing·31 second hop
Which Is the Worst-Case Nash Equilibrium? (2003)Which Is the Worst-Case Nash Equilibrium?Nashification and the Coordination Ratio for a Selfish Routing Game (2003)Nashification and the Coordin…Approximate Equilibria and Ball Fusion (2003)Approximate Equilibria and Ba…Tight bounds for worst-case equilibria (2002)Tight bounds for worst-case e…The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (2002)The Structure and Complexity …Algorithms, games, and the internet (2001)Algorithms, games, and the in…Worst-Case Equilibria (1999)Worst-Case EquilibriaA Course in Game Theory (1994)A Course in Game TheoryNon-cooperative games (1989)Non-cooperative gamesStrategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon (1978)Strategically zero-sum games:…Non-Cooperative Games (1951)Non-Cooperative GamesEquilibrium points in n -person games (1950)Equilibrium points in n -pers…Selfish Unsplittable Flows (2004)Selfish Unsplittable FlowsReexamination of the perfectness concept for equilibrium points in extensive games (1975)Selfish Load Balancing (2007)Regret minimization and the price of total anarchy (2008)Exact Price of Anarchy for Polynomial Congestion Games (2011)Games with Incomplete Information Played by ‘Bayesian’ Players, Part III. The Basic Probability Distribution of the Game (1968)Subjectivity and correlation in randomized strategies (1974)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Adaptive Heuristics (2005)Flows and Decompositions of Games: Harmonic and Potential Games (2011)Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness (2011)A class of games possessing pure-strategy Nash equilibria (1973)Near-optimal network design with selfish agents (2003)The price of selfish behavior in bilateral network formation (2005)Strong price of anarchy (2008)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)RATIONAL CHOICE AND THE FRAMING OF DECISIONS (1988)Algorithmic Mechanism Design (2001)The Theory of Incentives: The Principal-Agent Model (2001)Theory of games and economic behavior (2019)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)The Price of Fairness (2011)Selfish unsplittable flows (2005)On nash equilibria for a network creation game (2006)Tight bounds for worst-case equilibria (2007)Evolutionary games on graphs (2007)Existence of an equilibrium for a competitive economy (2008)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)Worst-case equilibria (2009)Prediction, Learning, and Games (2006)Covenants with and without a Sword: Self-Governance Is Possible (1992)A theory of sequential reciprocity (2003)
this work references cited by second hop

References

  • 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
  • 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
  • 2003Nashification and the Coordination Ratio for a Selfish Routing Game107 cited

Cited by

  • 2004Selfish Unsplittable Flows43 cited

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