纳什均衡复杂度

Complexity of Nash

Lecturer: Constantinos Daskalakis

Function NP(FNP)

The complexity class FNP is the function problem(output is more complex) extension of the decision problem (output Yes or No) class NP.

Search problem L:

​ Def. Relation $R_L\subseteq${0,1}* $\times$ {0,1}* : $(x,y)\in R_L$ iff y is a solution to x

A search problem is a total iff:

​ $\forall x, \exists y$ : $(x,y)\in R$

$L\in FNP$:

​ $\exists A_L(.,.)$ which is a p-time algorithm, and polynnomial function $p_L(.)$:

​ (1) $\forall x,y$: $A_L(x,y)=1 \Leftrightarrow (x,y)\in R_L$

​ (2) $\forall x:$ $\exists y$ s.t. $(x,y)\in R_L \Rightarrow \exists z$ with