Query complexity of approximate equilibria in anonymous games (Q2403236): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2740520762 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.6455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the deterministic complexity of searching local maxima / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best-reply dynamics in large binary-choice anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query complexity of approximate nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anonymous games with binary actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of pure strategy equilibria infinite anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetries and the complexity of pure Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Settling the complexity of computing two-player Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria in Anonymous Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing Anonymous Games using Simple Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient PTAS for Two-Strategy Anonymous Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A size-free CLT for poisson multinomials and its applications / 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: On oblivious PTAS's for nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Nash equilibria in anonymous games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse covers for sums of indicators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fourier transform of poisson multinomial distributions and its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nash Equilibria and Other Fixed Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5744805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic Query Complexity for Approximate Nash Computation in Large Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distribution function for the Poisson binomial distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Robust Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiagent Learning in Large Anonymous Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Randomized and Quantum Local Search / rank
 
Normal rank

Latest revision as of 10:30, 14 July 2024

scientific article
Language Label Description Also known as
English
Query complexity of approximate equilibria in anonymous games
scientific article

    Statements

    Query complexity of approximate equilibria in anonymous games (English)
    0 references
    0 references
    0 references
    15 September 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    computational complexity
    0 references
    game theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references