SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An Optimization Approach for Approximate Nash Equilibria
4 references·12 citing·36 second hopsampled
An Optimization Approach for Approximate Nash Equilibria (2007)An Optimization Approach for Approximate …Mixed-Integer Programming Methods for Finding Nash Equilibria (2018)Mixed-Integer Programming Met…A note on approximate Nash equilibria (2008)A note on approximate Nash eq…Progress in approximate nash equilibria (2007)Progress in approximate nash …Settling the Complexity of Two-Player Nash Equilibrium (2006)Settling the Complexity of Tw…Approximating Nash Equilibria in Tree Polymatrix Games (2015)Approximating Nash Equilibria…On the communication complexity of approximate Nash equilibria (2014)On the communication complexi…Computing approximate Nash equilibria in general network revenue management games (2014)Computing approximate Nash eq…On the Complexity of Approximating a Nash Equilibrium (2013)On the Complexity of Approxim…On the Performance of Approximate Equilibria in Congestion Games (2010)On the Performance of Approxi…On oblivious PTAS's for nash equilibrium (2009)On oblivious PTAS's for nash …New algorithms for approximate Nash equilibria in bimatrix games (2009)New algorithms for approximat…Computing equilibria: a computational complexity perspective (2009)Computing equilibria: a compu…Well Supported Approximate Equilibria in Bimatrix Games (2008)Well Supported Approximate Eq…Discretized multinomial distributions and Nash equilibria in anonymous games (2008)Discretized multinomial distr…Approximate Nash Equilibria for Multi-player Games (2008)Approximate Nash Equilibria f…Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games (2006)Polynomial Algorithms for App…Non-Cooperative Games (1951)Equilibrium Points of Bimatrix Games (1964)A Note on Approximate Nash Equilibria (2006)Computing Equilibria in Anonymous Games (2007)An Optimization Approach for Approximate Nash Equilibria (2008)Equilibrium points in n -person games (1950)Game theory: analysis of conflict (1992)An efficient heuristic approach for security against multiple adversaries (2007)Lossless abstraction of imperfect information games (2007)A class of games possessing pure-strategy Nash equilibria (1973)Potential Games (1996)Algorithmic Game Theory (2007)Efficiency of Restricted Tolls in Non-atomic Network Routing Games (2011)Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games (2011)Price of Stability in Polynomial Congestion Games (2015)Zur Theorie der Gesellschaftsspiele (1928)Theory of Games and Economic Behavior (1946)Computing correlated equilibria in multi-player games (2008)Intrinsic robustness of the price of anarchy (2009)Theory of games and economic behavior (2019)An Inquiry into the Nature and Causes of the Wealth of Nations (1776)Bounded Rationality and the Emergence of Simplicity Amidst Complexity (2012)Pareto optimality in coalition formation (2013)What Automaton Model Captures Decision Making? The Necessity of Behavioral Complexity (2015)Non-cooperative games (1989)Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 (2013)Computing Approximate Nash Equilibria in Polymatrix Games (2015)The Complexity of Finding Nash Equilibria (2007)The Complexity of Computing a Nash Equilibrium (2009)Congestion Games with Player-Specific Payoff Functions (1996)The complexity of computing a Nash equilibrium (2006)Approximate Nash equilibria in anonymous games (2014)Exposition of a New Theory on the Measurement of Risk (1954)Inapproximability of Nash Equilibrium (2015)Inapproximability of Nash Equilibrium (2018)Playing large games using simple strategies (2003)
this work references cited by second hop· second hop is a sample of the most-cited connections

References

  • 2006Settling the Complexity of Two-Player Nash Equilibrium493 cited
  • 2007Progress in approximate nash equilibria149 cited
  • 2008A note on approximate Nash equilibria143 cited
  • 2018Mixed-Integer Programming Methods for Finding Nash Equilibria130 cited

Cited by

  • 2006Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games102 cited
  • 2009On oblivious PTAS's for nash equilibrium93 cited
  • 2013On the Complexity of Approximating a Nash Equilibrium84 cited
  • 2009New algorithms for approximate Nash equilibria in bimatrix games71 cited
  • 2010On the Performance of Approximate Equilibria in Congestion Games67 cited
  • 2009Computing equilibria: a computational complexity perspective60 cited
  • 2008Well Supported Approximate Equilibria in Bimatrix Games53 cited
  • 2008Discretized multinomial distributions and Nash equilibria in anonymous games50 cited
  • 2015Approximating Nash Equilibria in Tree Polymatrix Games37 cited
  • 2008Approximate Nash Equilibria for Multi-player Games35 cited
  • 2014On the communication complexity of approximate Nash equilibria32 cited

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

  • 2014Computing approximate Nash equilibria in general network revenue management games13 cited