SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Pure Nash Equilibria in Games with a Large Number of Actions
16 references·0 citing·34 second hop
Pure Nash Equilibria in Games with a Large Number of Actions (2005)Pure Nash Equilibria in Games with a Larg…The Computational Complexity of Nash Equilibria in Concisely Represented Games (2005)The Computational Complexity …Selfish unsplittable flows (2005)Selfish unsplittable flowsThe complexity of pure Nash equilibria (2004)The complexity of pure Nash e…Selfish Unsplittable Flows (2004)Selfish Unsplittable FlowsNash Equilibria in Discrete Routing Games with Convex Latency Functions (2004)Nash Equilibria in Discrete R…Pure Nash equilibria (2003)Pure Nash equilibriaThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game (2002)The Structure and Complexity …Complexity Results about Nash Equilibria (2002)Complexity Results about Nash…Algorithms, games, and the internet (2001)Algorithms, games, and the in…A Course in Game Theory (1994)A Course in Game TheoryThe complexity of two-person zero-sum games in extensive form (1992)The complexity of two-person …On platers with a bounded number of states (1992)On platers with a bounded num…The complexity of computing a best response automaton in repeated games with mixed strategies (1990)The complexity of computing a…Non-cooperative games (1989)Non-cooperative gamesNash and correlated equilibria: Some complexity considerations (1989)Nash and correlated equilibri…Non-Cooperative Games (1951)Non-Cooperative GamesEquilibrium points in n -person games (1950)Stochastic Games (1953)The complexity of computing a Nash equilibrium (2006)Multiagent systems: algorithmic, game-theoretic, and logical foundations (2009)Games and Decisions (2015)Theory of Games and Economic Behavior (1946)11. Extensive Games and the Problem of Information (1953)Efficient Computation of Behavior Strategies (1996)Representations and solutions for game-theoretic problems (1997)Theory of games and economic behavior (2019)A class of games possessing pure-strategy Nash equilibria (1973)Potential Games (1996)Worst-Case Equilibria (1999)The price of anarchy of finite congestion games (2005)The Price of Routing Unsplittable Flow (2005)Selfish Routing and the Price of Anarchy (2016)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)Evolution and the Theory of Games (1982)The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms (2003)Prediction, Learning, and Games (2006)The Price of Fairness (2011)Subjectivity and correlation in randomized strategies (1974)The Complexity of Computing a Nash Equilibrium (2009)Graphical Models for Game Theory (2013)Two-Person Cooperative Games (1953)Reexamination of the perfectness concept for equilibrium points in extensive games (1975)Games with Incomplete Information Played by “Bayesian” Players, I–III: Part I. The Basic Model (2004)Computing correlated equilibria in multi-player games (2008)The Price of Stability for Network Design with Fair Cost Allocation (2004)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

  • 1951Non-Cooperative Games6,999 cited
  • 1989Non-cooperative games5,661 cited
  • 1994A Course in Game Theory5,513 cited
  • 2001Algorithms, games, and the internet1,107 cited
  • 2004The complexity of pure Nash equilibria662 cited
  • 1989Nash and correlated equilibria: Some complexity considerations408 cited
  • 2002Complexity Results about Nash Equilibria234 cited
  • 2002The Structure and Complexity of Nash Equilibria for a Selfish Routing Game218 cited
  • 2005Selfish unsplittable flows212 cited
  • 1992The complexity of two-person zero-sum games in extensive form207 cited
  • 1990The complexity of computing a best response automaton in repeated games with mixed strategies70 cited
  • 2004Nash Equilibria in Discrete Routing Games with Convex Latency Functions55 cited
  • 1992On platers with a bounded number of states54 cited
  • 2005The Computational Complexity of Nash Equilibria in Concisely Represented Games54 cited
  • 2003Pure Nash equilibria53 cited
  • 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

Cited by

No citing works inside the corpus for this window.