05 - Comprehension Questions for Algorithmic Game Theory
Please answer these questions concisely (ideally 1 sentence each).
Sign in to Google to save your progress. Learn more
Name *
Email *
Explain in one sentence, why 2-player zero-sum games are computationally easy to solve. *
Explain in one sentence, why we cannot simply use linear programming tol solve 3-player games *
What makes finding a correlated equilibrium computationally easier than finding a Nash equilibrium in a general-sum n-player normal form game? *
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy