Query complexity of approximate nash equilibria
From MaRDI portal
Publication:5259589
DOI10.1145/2591796.2591829zbMath1315.91003arXiv1306.6686OpenAlexW1981247840MaRDI QIDQ5259589
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.6686
complexityrate of convergencegame theoryfixed pointadaptive dynamicsquery complexityapproximate Nash equilibrium
Analysis of algorithms and problem complexity (68Q25) (n)-person games, (n>2) (91A06) Approximation algorithms (68W25)
Related Items (9)
Inapproximability of Nash Equilibrium ⋮ ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria ⋮ Query Complexity of Approximate Equilibria in Anonymous Games ⋮ The query complexity of correlated equilibria ⋮ Communication complexity of approximate Nash equilibria ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Logarithmic query complexity for approximate Nash computation in large games ⋮ Logarithmic Query Complexity for Approximate Nash Computation in Large Games ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
This page was built for publication: Query complexity of approximate nash equilibria
