05  Comprehension Questions for Algorithmic Game Theory
Please answer these questions concisely (ideally 1 sentence each).
* Required
Name
*
Your answer
Email
*
Your answer
Explain in one sentence, why 2player zerosum games are computationally easy to solve.
*
Your answer
Explain in one sentence, why we cannot simply use linear programming tol solve 3player games
*
Your answer
What makes finding a correlated equilibrium computationally easier than finding a Nash equilibrium in a generalsum nplayer normal form game?
*
Your answer
Submit
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google.
Report Abuse

Terms of Service

Privacy Policy
Forms