Finding a Nash equilibrium in spatial games is an NP-complete problem
نویسندگان
چکیده
منابع مشابه
Inapproximability of NP-Complete Variants of Nash Equilibrium
In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an ε-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size O(logn) in the random graph G(n,1/2). This raises the question of whether a similar intractability holds for approximate Nash equilibrium without side constraints such as high value. We give ...
متن کاملSystem Design Is an NP-Complete Problem
The system design process translates the customers’ needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system’s performance and cost goals. This paper proves that the System Design Problem is NP-complete by red...
متن کاملExclusion Method for Finding Nash Equilibrium in Multiplayer Games
We present a complete algorithm for finding an εNash equilibrium, for arbitrarily small ε, in games with more than two players. The best prior complete algorithm has significantly worse complexity and has, to our knowledge, never been implemented. The main components of our treesearch-based method are a node-selection strategy, an exclusion oracle, and a subdivision scheme. The node-selection s...
متن کاملFinding a simple Nash Equilibrium
Non-cooperative game theory has been tightly combined with Computational Methods, in which the Nash Equilibrium (NE) is undoubtedly the most important solution concept. While players face several Nash Equilibriums, their most pragmatic strategy may not be the most optimal one, but one they prefer for other reasons. Players may choose a sub-optimal strategy instead of a more optimal but more com...
متن کاملAn NP-Complete Problem in Grid Coloring
A c-coloring of Gn,m = [n] × [m] is a mapping of Gn,m into [c] such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the internet to find a 4-coloring of G17,17. This attracted considerable attention from the popular mathematics community. A coloring was produced; however, finding it proved to be difficult. The question arises: is the problem of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Economic Theory
سال: 2004
ISSN: 0938-2259,1432-0479
DOI: 10.1007/s00199-003-0376-1