<--- Back to Details
First PageDocument Content
Gaming / Nash equilibrium / Repeated game / Outcome / Minimax / Symmetric game / Normal-form game / PPAD / Best response / Game theory / Problem solving / Decision theory
Date: 2008-02-01 19:30:15
Gaming
Nash equilibrium
Repeated game
Outcome
Minimax
Symmetric game
Normal-form game
PPAD
Best response
Game theory
Problem solving
Decision theory

Add to Reading List

Source URL: research.microsoft.com

Download Document from Source Website

File Size: 225,25 KB

Share Document on Facebook

Similar Documents

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

DocID: 1tNIR - View Document

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

DocID: 1tnXN - View Document

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

DocID: 1tmJE - View Document

Computational complexity theory / Theory of computation / Complexity classes / NP / Clique problem / Linear programming / P / Algorithm / Time complexity / Optimization problem / Book:Graph Theory / P versus NP problem

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

DocID: 1rfbK - View Document

Computational complexity theory / Complexity classes / Theory of computation / PPAD / Reduction / LemkeHowson algorithm / Algorithm / NP / PSPACE-complete / P / True quantified Boolean formula

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

DocID: 1q2Cn - View Document