Learning and Efficiency in Games with Dynamic Population

DOI10.1137/1.9781611974331.ch9zbMath1417.91124arXiv1505.00391OpenAlexW2951917116MaRDI QIDQ4575584

Éva Tardos, Vasilis Syrgkanis, Thodoris Lykouris

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.00391

zbMATH Keywords

repeated gameslearning in gamesprice of anarchydynamic player population

Mathematics Subject Classification ID

Rationality and learning in game theory (91A26) Evolutionary games (91A22)

Related Items (5)

Learning in auctions: regret is hard, envy is easy ⋮ Smoothness for Simultaneous Composition of Mechanisms with Admission ⋮ Differential privacy may have a potential optimization effect on some swarm intelligence algorithms besides privacy-preserving ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Small-Loss Bounds for Online Learning with Partial Information

This page was built for publication: Learning and Efficiency in Games with Dynamic Population