Communication complexity of correlated equilibrium with small support
From MaRDI portal
Publication:5009504
Recommendations
Cites work
- Algorithmic Game Theory
- Communication Complexity
- Communication complexity (for algorithm designers)
- Computing correlated equilibria in multi-player games
- Computing equilibria: a computational complexity perspective
- Correlated Equilibrium as an Expression of Bayesian Rationality
- Distributed Methods for Computing Approximate Equilibria
- Empirical distribution of equilibrium play and its testing application
- Existence of Correlated Equilibria
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- Learning equilibria of games via payoff queries
- Lower bounds in communication complexity
- Nash and correlated equilibria: Some complexity considerations
- Non-cooperative games
- On the distributional complexity of disjointness
- Polynomial-time computation of exact correlated equilibrium in compact games
- Rational Learning Leads to Nash Equilibrium
- Regret-based continuous-time dynamics.
- Simple adaptive strategies. From regret-matching to uncoupled dynamics. With the collaboration of Yakov Babichenko, Amotz Cahn, Yishay Mansour and David Schmeidler
- Stochastic uncoupled dynamics and Nash equilibrium
- Subjectivity and correlation in randomized strategies
- The Probabilistic Communication Complexity of Set Intersection
- The complexity of all-switches strategy improvement
- Twenty lectures on algorithmic game theory
Cited in
(5)
This page was built for publication: Communication complexity of correlated equilibrium with small support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009504)
