Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (Q5020727): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: 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: The communication complexity of local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity of approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174120 / 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: Q5808755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4638112 / 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: 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: A note on approximate Nash equilibria / 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: Q5744805 / 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: Rectangles Are Nonnegative Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds via critical block sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query-to-Communication Lifting for BPP / 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: 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: On the virtue of succinct proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Learning Leads to Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for approximating Nash equilibria of bimatrix games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple complexity from imitation games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy waves, the zig-zag graph product, and new constant-degree expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method of solving a game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5133220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Nash Equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3216275777 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:43, 30 July 2024

scientific article; zbMATH DE number 7453415
Language Label Description Also known as
English
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
scientific article; zbMATH DE number 7453415

    Statements

    Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2022
    0 references
    0 references
    communication complexity
    0 references
    game theory
    0 references
    Nash equilibrium
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references