Inapproximability results for constrained approximate Nash equilibria (Q1784945): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129723213, #quickstatements; #temporary_batch_1726341741784
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2018.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2806555090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing a Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash and correlated equilibria: Some complexity considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results about Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for approximate Nash equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Methods for Computing Approximate Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate well-supported Nash equilibria below two-thirds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well supported approximate equilibria in bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is It to Approximate the Best Nash Equilibrium? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the best Nash Equilibrium in <i>n<sup>o</sup></i><sup>(log <i>n</i>)</sup>-time breaks the Exponential Time Hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse approximations to randomized strategies and convex combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability Results for Approximate Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Almost Everybody be Almost Happy? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-query PCP with subconstant error / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PCP theorem by gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On oblivious PTAS's for nash equilibrium / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129723213 / rank
 
Normal rank

Latest revision as of 20:29, 14 September 2024

scientific article
Language Label Description Also known as
English
Inapproximability results for constrained approximate Nash equilibria
scientific article

    Statements

    Inapproximability results for constrained approximate Nash equilibria (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2018
    0 references
    approximate Nash equilibrium
    0 references
    constrained equilibrium
    0 references
    quasi-polynomial time
    0 references
    lower bound
    0 references
    exponential time hypothesis
    0 references
    0 references
    0 references

    Identifiers