SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
How Hard Is It to Approximate the Best Nash Equilibrium?
3 references·3 citing·23 second hop
How Hard Is It to Approximate the Best Nash Equilibrium? (2011)How Hard Is It to Approximate the Best Na…The complexity of computing a Nash equilibrium (2009)The complexity of computing a…The Complexity of Computing a Nash Equilibrium (2009)The Complexity of Computing a…Nash and correlated equilibria: Some complexity considerations (1989)Nash and correlated equilibri…Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games (2016)Hardness Results for Signalin…Mixture Selection, Mechanism Design, and Signaling (2015)Mixture Selection, Mechanism …On the Hardness of Signaling (2014)On the Hardness of SignalingZur Theorie der Gesellschaftsspiele (1928)Non-Cooperative Games (1951)Equilibrium Points of Bimatrix Games (1964)Intrinsic robustness of the price of anarchy (2009)Games on Networks (2014)Core Challenges of Social Robot Navigation: A Survey (2023)Graphical Models for Game Theory (2013)Approximate Nash equilibria in anonymous games (2014)Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation (2016)Twenty Lectures on Algorithmic Game Theory (2016)The Market for "Lemons": Quality Uncertainty and the Market Mechanism (1970)Job Market Signaling (1973)The Private and Social Value of Information and the Reward to Inventive Activity (1978)Persuasion with Limited Communication (2016)Algorithmic Persuasion with No Externalities (2017)Subjectivity and correlation in randomized strategies (1974)Non-cooperative games (1989)A Theory of Auctions and Competitive Bidding (1982)Algorithmic information structure design (2017)Signaling in Bayesian Network Congestion Games: the Subtle Power of Symmetry (2021)Playing large games using simple strategies (2003)Signaling schemes for revenue maximization (2012)Signaling Schemes for Revenue Maximization (2014)
this work references cited by second hop

References

  • 2009The Complexity of Computing a Nash Equilibrium922 cited
  • 1989Nash and correlated equilibria: Some complexity considerations406 cited
  • 2009The complexity of computing a Nash equilibrium235 cited

Cited by

  • 2016Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games72 cited
  • 2015Mixture Selection, Mechanism Design, and Signaling42 cited
  • 2014On the Hardness of Signaling40 cited

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