Matches in SemOpenAlex for { <https://semopenalex.org/work/W1828524803> ?p ?o ?g. }
Showing items 1 to 85 of
85
with 100 items per page.
- W1828524803 endingPage "25" @default.
- W1828524803 startingPage "13" @default.
- W1828524803 abstract "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,frac12)$ . This raises the question of whether a similar intractability holds for approximate Nash equilibrium without such constraints. We give evidence that the constraint of near-optimal value makes the problem distinctly harder: a simple algorithm finds an optimal $frac{1}{2}$ -approximate equilibrium, while finding strictly better than $frac12$ -approximate equilibria is as hard as the Hidden Clique problem. This is in contrast to the unconstrained problem where more sophisticated algorithms, achieving better approximations, are known. Unlike general Nash equilibrium, which is in PPAD, optimal (maximum value) Nash equilibrium is NP-hard. We proceed to show that optimal Nash equilibrium is just one of several known NP-hard problems related to Nash equilibrium, all of which have approximate variants which are as hard as finding a planted clique. In particular, we show this for approximate variants of the following problems: finding a Nash equilibrium with value greater than η (for any η > 0, even when the best Nash equilibrium has value 1 − η), finding a second Nash equilibrium, and finding a Nash equilibrium with small support. Finally, we consider the complexity of approximate pure Bayes Nash equilibria in two-player games. Here we show that for general Bayesian games the problem is NP-hard. For the special case where the distribution over types is uniform, we give a quasi-polynomial time algorithm matched by a hardness result based on the Hidden Clique problem." @default.
- W1828524803 created "2016-06-24" @default.
- W1828524803 creator A5042816355 @default.
- W1828524803 creator A5043851880 @default.
- W1828524803 creator A5055776088 @default.
- W1828524803 date "2011-01-01" @default.
- W1828524803 modified "2023-10-16" @default.
- W1828524803 title "Inapproximability of NP-Complete Variants of Nash Equilibrium" @default.
- W1828524803 cites W1497517366 @default.
- W1828524803 cites W1828524803 @default.
- W1828524803 cites W1972894929 @default.
- W1828524803 cites W2013815105 @default.
- W1828524803 cites W2057913812 @default.
- W1828524803 cites W2062961409 @default.
- W1828524803 cites W2069488552 @default.
- W1828524803 cites W2072656810 @default.
- W1828524803 cites W2075425349 @default.
- W1828524803 cites W2122497197 @default.
- W1828524803 cites W2131967794 @default.
- W1828524803 cites W2136105862 @default.
- W1828524803 cites W2166602562 @default.
- W1828524803 cites W2169359757 @default.
- W1828524803 cites W2292587149 @default.
- W1828524803 cites W3122057941 @default.
- W1828524803 doi "https://doi.org/10.1007/978-3-642-22935-0_2" @default.
- W1828524803 hasPublicationYear "2011" @default.
- W1828524803 type Work @default.
- W1828524803 sameAs 1828524803 @default.
- W1828524803 citedByCount "5" @default.
- W1828524803 countsByYear W18285248032012 @default.
- W1828524803 countsByYear W18285248032016 @default.
- W1828524803 countsByYear W18285248032023 @default.
- W1828524803 crossrefType "book-chapter" @default.
- W1828524803 hasAuthorship W1828524803A5042816355 @default.
- W1828524803 hasAuthorship W1828524803A5043851880 @default.
- W1828524803 hasAuthorship W1828524803A5055776088 @default.
- W1828524803 hasBestOaLocation W18285248032 @default.
- W1828524803 hasConcept C114614502 @default.
- W1828524803 hasConcept C126255220 @default.
- W1828524803 hasConcept C141824439 @default.
- W1828524803 hasConcept C144237770 @default.
- W1828524803 hasConcept C163630976 @default.
- W1828524803 hasConcept C164407509 @default.
- W1828524803 hasConcept C16946829 @default.
- W1828524803 hasConcept C177142836 @default.
- W1828524803 hasConcept C202556891 @default.
- W1828524803 hasConcept C22349654 @default.
- W1828524803 hasConcept C32407928 @default.
- W1828524803 hasConcept C33923547 @default.
- W1828524803 hasConcept C46814582 @default.
- W1828524803 hasConcept C93979843 @default.
- W1828524803 hasConceptScore W1828524803C114614502 @default.
- W1828524803 hasConceptScore W1828524803C126255220 @default.
- W1828524803 hasConceptScore W1828524803C141824439 @default.
- W1828524803 hasConceptScore W1828524803C144237770 @default.
- W1828524803 hasConceptScore W1828524803C163630976 @default.
- W1828524803 hasConceptScore W1828524803C164407509 @default.
- W1828524803 hasConceptScore W1828524803C16946829 @default.
- W1828524803 hasConceptScore W1828524803C177142836 @default.
- W1828524803 hasConceptScore W1828524803C202556891 @default.
- W1828524803 hasConceptScore W1828524803C22349654 @default.
- W1828524803 hasConceptScore W1828524803C32407928 @default.
- W1828524803 hasConceptScore W1828524803C33923547 @default.
- W1828524803 hasConceptScore W1828524803C46814582 @default.
- W1828524803 hasConceptScore W1828524803C93979843 @default.
- W1828524803 hasLocation W18285248031 @default.
- W1828524803 hasLocation W18285248032 @default.
- W1828524803 hasOpenAccess W1828524803 @default.
- W1828524803 hasPrimaryLocation W18285248031 @default.
- W1828524803 hasRelatedWork W1554758635 @default.
- W1828524803 hasRelatedWork W157961742 @default.
- W1828524803 hasRelatedWork W1667857601 @default.
- W1828524803 hasRelatedWork W1721270588 @default.
- W1828524803 hasRelatedWork W2025767136 @default.
- W1828524803 hasRelatedWork W2122414948 @default.
- W1828524803 hasRelatedWork W3099302628 @default.
- W1828524803 hasRelatedWork W4299551322 @default.
- W1828524803 hasRelatedWork W4301347782 @default.
- W1828524803 hasRelatedWork W2274855902 @default.
- W1828524803 isParatext "false" @default.
- W1828524803 isRetracted "false" @default.
- W1828524803 magId "1828524803" @default.
- W1828524803 workType "book-chapter" @default.