Communication complexity of approximate Nash equilibria (Q2155907): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 6761863
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1369.68213 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3055399.3055407 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing / rank
 
Normal rank
Property / publication date
 
17 August 2017
Timestamp+2017-08-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 August 2017 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6761863 / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence rate
Property / zbMATH Keywords: convergence rate / rank
 
Normal rank
Property / zbMATH Keywords
 
uncoupled dynamics
Property / zbMATH Keywords: uncoupled dynamics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3046976141 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963464038 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.06580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely uncoupled dynamics and Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query complexity of 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: The communication complexity of local search / 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: Q4638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed methods for computing approximate equilibria / 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: Q5009504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Nash convergence of Foster and Young's regret testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the communication complexity of approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: How long to equilibrium? The communication complexity of uncoupled equilibrium procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regret-based continuous-time dynamics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic uncoupled dynamics and Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Adaptive Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The query complexity of correlated equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for finding Brouwer fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time computation of exact correlated equilibrium in compact games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Learning Leads to Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-logarithmic depth lower bounds via the direct sum in communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple complexity from imitation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Power of Demand Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing correlated equilibria in multi-player games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of the monotone NC hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone circuits for matching require linear depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning by trial and error / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:05, 29 July 2024

scientific article; zbMATH DE number 6761863
Language Label Description Also known as
English
Communication complexity of approximate Nash equilibria
scientific article; zbMATH DE number 6761863

    Statements

    Communication complexity of approximate Nash equilibria (English)
    0 references
    0 references
    0 references
    15 July 2022
    0 references
    17 August 2017
    0 references
    communication complexity
    0 references
    approximate Nash equilibria
    0 references
    convergence rate of uncoupled dynamics
    0 references
    convergence rate
    0 references
    uncoupled dynamics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references