Complexity of fixed points, I
نویسندگان
چکیده
منابع مشابه
Computational complexity of fixed points
A review of computational complexity results for approximating fixed points of Lipschitz functions is presented. Univariate and multivariate results are summarized for the second and infinity norm cases as well as the absolute, residual and relative error criteria. Contractive, nonexpansive, directionally nonexpansive, and expansive classes of functions are considered and optimal or nearly opti...
متن کاملFixed Points , and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games (stochastic and other games); stable configurations of neural networks; analysing basic stochastic models for evolution like branching processes and for language l...
متن کاملEquilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games (stochastic and other games); stable configurations of neural networks; analysing basic stochastic models for evolution like branching processes and for language l...
متن کاملThe Lempel-Ziv Complexity of Fixed Points of Morphisms
The Lempel–Ziv complexity is a fundamental measure of complexity for words, closely connected with the famous LZ77 compression algorithm. We investigate this complexity measure for one of the most important families of infinite words in combinatorics, namely the fixed points of morphisms. We give a complete characterization of the complexity classes which are Θ(1), Θ(log n), and Θ(n1/k), k ∈ N,...
متن کاملOn the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity of the associated problems. Specifically, we study the complexity of the following problem: given a finite game, Γ, with 3 or more players, and given > 0, compute an approximation within of some (actual) Nash equilibrium...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 1987
ISSN: 0885-064X
DOI: 10.1016/0885-064x(87)90008-2