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

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6761863
@@ Property / zbMATH Open document ID @@
+.68213
@@ Property / zbMATH Open document ID: 1369.68213 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/3055399.3055407
@@ Property / DOI: 10.1145/3055399.3055407 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
+Normal rank
@@ Property / publication date @@
+August 2017Timestamp +2017-08-17T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-08-17T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 17 August 2017 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q10
@@ Property / Mathematics Subject Classification ID: 68Q10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A10
@@ Property / Mathematics Subject Classification ID: 91A10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6761863
@@ 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 / OpenAlex ID @@
+W3046976141
@@ Property / OpenAlex ID: W3046976141 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963464038
@@ Property / OpenAlex ID: W2963464038 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06580
@@ Property / arXiv ID: 1608.06580 / rank @@
+Normal rank
@@ Property / cites work @@
+Completely uncoupled dynamics and Nash equilibria
@@ Property / cites work: Completely uncoupled dynamics and Nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Query complexity of approximate nash equilibria
@@ Property / cites work: Query complexity of approximate nash equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Can Almost Everybody be Almost Happy?
@@ Property / cites work: Can Almost Everybody be Almost Happy? / rank @@
+Normal rank
@@ Property / cites work @@
+The communication complexity of local search
@@ Property / cites work: The communication complexity of local search / rank @@
+Normal rank
@@ Property / cites work @@
+Settling the complexity of computing two-player Nash equilibria
+Normal rank
@@ Property / cites work @@
+Q4638112
@@ Property / cites work: Q4638112 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed methods for computing approximate equilibria
+Normal rank
@@ Property / cites work @@
+The Complexity of Computing a Nash Equilibrium
@@ Property / cites work: The Complexity of Computing a Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Q5009504
@@ Property / cites work: Q5009504 / rank @@
+Normal rank
@@ Property / cites work @@
+Global Nash convergence of Foster and Young's regret testing
+Normal rank
@@ Property / cites work @@
+On the communication complexity of approximate Nash equilibria
+Normal rank
@@ Property / cites work @@
+Q5111142
@@ Property / cites work: Q5111142 / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
+Normal rank
@@ Property / cites work @@
+How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
+Normal rank
@@ Property / cites work @@
+Regret-based continuous-time dynamics.
@@ Property / cites work: Regret-based continuous-time dynamics. / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic uncoupled dynamics and Nash equilibrium
+Normal rank
@@ Property / cites work @@
+Simple Adaptive Strategies
@@ Property / cites work: Simple Adaptive Strategies / rank @@
+Normal rank
@@ Property / cites work @@
+The query complexity of correlated equilibria
@@ Property / cites work: The query complexity of correlated equilibria / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for finding Brouwer fixed points
+Normal rank
@@ Property / cites work @@
+Polynomial-time computation of exact correlated equilibrium in compact games
+Normal rank
@@ Property / cites work @@
+Rational Learning Leads to Nash Equilibrium
@@ Property / cites work: Rational Learning Leads to Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Super-logarithmic depth lower bounds via the direct sum in communication complexity
+Normal rank
@@ Property / cites work @@
+Simple complexity from imitation games
@@ Property / cites work: Simple complexity from imitation games / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+On the Computational Power of Demand Queries
@@ Property / cites work: On the Computational Power of Demand Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Computing correlated equilibria in multi-player games
+Normal rank
@@ Property / cites work @@
+Separation of the monotone NC hierarchy
@@ Property / cites work: Separation of the monotone NC hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Monotone circuits for matching require linear depth
+Normal rank
@@ Property / cites work @@
+Inapproximability of Nash Equilibrium
@@ Property / cites work: Inapproximability of Nash Equilibrium / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of algorithms
@@ Property / cites work: Smoothed analysis of algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3421283
@@ Property / cites work: Q3421283 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning by trial and error
@@ Property / cites work: Learning by trial and error / rank @@
+Normal rank