This question came up while I was going through Siu On Chan's paper on Approximation Resistance. My question is not really related to the paper though. I also guess that this is more of a reference request kind of question (preferably some lecture notes or surveys). I hope what follows helps putting the question in perspective, so please bear with me.
I recently started studying up the literature on PCPs and inapproximability and my knowledge is small. I know the proof of PCP theorem. The proof I read is Dinur's proof as presented in Arora Barak. All the while, I saw the two contrasting views of the PCP theorem
(i) the prover, verifier view and, (ii) the view related to a deciding a gap instance of a CSP (for some constant gap).
Now, my question is the following. While going through Siu's paper, I got the impression that 2 prover 1-verifier games are relevant to PCP literature. My current knowledge base is so shamelessly small that I do not really understand this. I just know the 2 views I described above and am not comfortable with the multiple provers view.
I mean, why is the value of a game with multiple provers even related to the PCP theorem where you have a single prover and a single verifier? Does the value of a game help you somehow argue about the soundness part?