PPAD

Results: 20



#Item
1CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Add to Reading List

Source URL: theory.stanford.edu

- Date: 2016-08-30 19:10:08
    2Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

    Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

    Add to Reading List

    Source URL: eprint.iacr.org

    - Date: 2016-11-02 14:33:31
      3Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

      Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Alon Rosen∗ Gil Segev†

      Add to Reading List

      Source URL: eprint.iacr.org

      - Date: 2016-11-02 14:33:31
        4CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

        CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

        Add to Reading List

        Source URL: theory.stanford.edu

        Language: English - Date: 2014-01-06 16:13:01
        5The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

        The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K.

        Add to Reading List

        Source URL: www.maths.lse.ac.uk

        Language: English - Date: 2013-10-30 13:41:09
        6Econ Theory:1–7 DOIs00199EDITORIAL Computation of Nash equilibria in finite games: introduction to the symposium

        Econ Theory:1–7 DOIs00199EDITORIAL Computation of Nash equilibria in finite games: introduction to the symposium

        Add to Reading List

        Source URL: www.maths.lse.ac.uk

        Language: English - Date: 2009-12-04 09:49:02
        7Pathways to Equilibria, Pretty Pictures and Diagrams (PPAD) Bernhard von Stengel partly joint work with: ´ ´

        Pathways to Equilibria, Pretty Pictures and Diagrams (PPAD) Bernhard von Stengel partly joint work with: ´ ´

        Add to Reading List

        Source URL: www.maths.lse.ac.uk

        Language: English - Date: 2014-11-11 13:54:25
        8Algorithmic Game Theory∗ Tim Roughgarden† May 12, 2009 1

        Algorithmic Game Theory∗ Tim Roughgarden† May 12, 2009 1

        Add to Reading List

        Source URL: theory.stanford.edu

        Language: English - Date: 2010-06-29 12:48:05
        9Adam Wierman, Caltech  Joint work with Federico Echenique, Siddharth Barman, Umang Bhaskar, Rachel Cummings, & Daniel Golovin My goal: Show why revealed preference theory can be valuable for computer scientists & engine

        Adam Wierman, Caltech Joint work with Federico Echenique, Siddharth Barman, Umang Bhaskar, Rachel Cummings, & Daniel Golovin My goal: Show why revealed preference theory can be valuable for computer scientists & engine

        Add to Reading List

        Source URL: users.cms.caltech.edu

        Language: English - Date: 2014-02-22 15:32:24
        10The Myth of the Folk Theorem Christian Borgs∗ Jennifer Chayes∗ Vahab Mirrokni∗

        The Myth of the Folk Theorem Christian Borgs∗ Jennifer Chayes∗ Vahab Mirrokni∗

        Add to Reading List

        Source URL: research.microsoft.com

        Language: English - Date: 2008-02-01 19:30:15