Smooth Nash equilibria: algorithms and complexity
From MaRDI portal
Cites work
- A bounded-rationality approach to the study of noncooperative games
- Approximate Nash Equilibria for Multi-player Games
- Boosting. Foundations and algorithms.
- Communication complexity of approximate Nash equilibria
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Empirical distribution of equilibrium play and its testing application
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- scientific article; zbMATH DE number 1804119 (Why is no real title available?)
- scientific article; zbMATH DE number 3152611 (Why is no real title available?)
- scientific article; zbMATH DE number 4141836 (Why is no real title available?)
- scientific article; zbMATH DE number 1306886 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- Imperfect equilibrium
- Inapproximability of Nash equilibrium
- Near-optimal communication lower bounds for approximate Nash equilibria
- On the complexity of approximating a Nash equilibrium
- PPAD is as hard as LWE and iterated squaring
- Quantal response equilibria for normal form games
- Quantal response equilibrium and overbidding in private-value auctions
- Quantal response equilibrium. A stochastic theory of games
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Refinements of the Nash equilibrium concept
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
- Settling the complexity of computing two-player Nash equilibria
- Smoothed analysis with adaptive adversaries
- Smoothed complexity of 2-player Nash equilibria
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- The complexity of computing a Nash equilibrium
- The cover number of a matrix and its algorithmic applications
- The multiplicative weights update method: a meta-algorithm and applications
- The Nash equilibrium: A perspective
- The uniform hardcore lemma via approximate Bregman projections
This page was built for publication: Smooth Nash equilibria: algorithms and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906398)
