Lesson plan
FIXP
In computer science, FIXP is a complexity class introduced by Kousha Etessami and Mihalis Yannakakis at 2010. It represents problems that can be solved by computing a fixed point of a function that satisfies the conditions of Brouwer's fixed point theorem. More formally, FIXP contains search problems that can be cast as fixed point computation problems for functions represented by algebraic circuits over basis {+,*,-,/,max,min} with rational constants. They prove that some fundamental problems in economics and game theory are complete for FIXP, in particular: * Nash equilibrium computation - computing an exact or approximate mixed-strategy Nash equilibrium in a game with three or more players. * Market equilibrium computation - computing competitive-equilibrium prices for exchange economies with algebraic demand functions.
Article summary
In computer science, FIXP is a complexity class introduced by Kousha Etessami and Mihalis Yannakakis at 2010. It represents problems that can be solved by computing a fixed point of a function that satisfies the conditions of Brouwer's fixed point theorem. More formally, FIXP contains search problems that can be cast as fixed point computation problems for functions represented by algebraic circuits over basis {+,*,-,/,max,min} with rational constants. They prove that some fundamental problems in economics and game theory are complete for FIXP, in particular: * Nash equilibrium computation - computing an exact or approximate mixed-strategy Nash equilibrium in a game with three or more players. * Market equilibrium computation - computing competitive-equilibrium prices for exchange economies with algebraic demand functions.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.