scientific article; zbMATH DE number 7378624
From MaRDI portal
Publication:5009504
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.12MaRDI QIDQ5009504
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Communication complexity of approximate Nash equilibria ⋮ Adventures in monotone complexity and TFNP
Cites Work
- Unnamed Item
- Computing equilibria: a computational complexity perspective
- Stochastic uncoupled dynamics and Nash equilibrium
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- Nash and correlated equilibria: Some complexity considerations
- On the distributional complexity of disjointness
- Subjectivity and correlation in randomized strategies
- Regret-based continuous-time dynamics.
- Communication complexity of approximate Nash equilibria
- Polynomial-time computation of exact correlated equilibrium in compact games
- On the communication complexity of approximate Nash equilibria
- Non-cooperative games
- Simple Adaptive Strategies
- Distributed Methods for Computing Approximate Equilibria
- Empirical Distribution of Equilibrium Play and Its Testing Application
- Rational Learning Leads to Nash Equilibrium
- Communication Complexity (for Algorithm Designers)
- Lower Bounds in Communication Complexity
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Existence of Correlated Equilibria
- The Probabilistic Communication Complexity of Set Intersection
- The Complexity of All-switches Strategy Improvement
- Communication Complexity
- Algorithmic Game Theory
- Twenty Lectures on Algorithmic Game Theory
- Computing correlated equilibria in multi-player games
This page was built for publication:
