Computing equilibria: a computational complexity perspective
نویسندگان
چکیده
منابع مشابه
Computing Equilibria: A Computational Complexity Perspective
Computational complexity is the subfield of computer science that rigorously studies the intrinsic difficulty of computational problems. This survey explains how complexity theory defines “hard problems”; applies these concepts to several equilibrium computation problems; and discusses implications for computation, games, and behavior. We assume minimal prior background in computer science.
متن کاملRandomness - A Computational Complexity Perspective
Man has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. This lecture will describe two main aspects of this research on randomness, demonstrating its power and weakness respectively. Randomness is paramount to computational efficiency: The use of randomness seems to dramatical...
متن کاملThe Computational Complexity of Nash Equilibria
Game theory has grown in importance as academics from all fields have realized the importance of strategy in domains of human behavior ranging from business to the Internet. The computational issues of game theory are important to both a game’s participants and designers. A participant in a game, or their consultant, obviously wants to compute their optimal moves in anticipation of their opppon...
متن کاملComputing Nash equilibria through computational intelligence methods
Nash equilibrium constitutes a central solution concept in game theory. The task of detecting the Nash equilibria of a finite strategic game remains a challenging problem up-to-date. This paper investigates the effectiveness of three computational intelligence techniques, namely, covariance matrix adaptation evolution strategies, particle swarm optimization, as well as, differential evolution, ...
متن کاملA Computational Complexity Theory in Membrane Computing
In this paper, a computational complexity theory within the framework of Membrane Computing is introduced. Polynomial complexity classes associated with different models of cell-like and tissue-like membrane systems are defined and the most relevant results obtained so far are presented. Many attractive characterizations of P 6= NP conjecture within the framework of a bio-inspired and non-conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2009
ISSN: 0938-2259,1432-0479
DOI: 10.1007/s00199-009-0448-y