FIXP
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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.
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.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1359406219 under CC BY-SA 4.0; modifications have been made.