No-Φ-Regret: A Connection between Computational Learning Theory and Game Theory

DOI10.1007/978-94-007-0714-6_7zbMATH Open1320.91031OpenAlexW137245701MaRDI QIDQ5261296FDOQ5261296

Amy Greenwald, Casey Marks, Amir Jafari

Publication date: 3 July 2015

Published in: Games, Norms and Reasons (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-94-007-0714-6_7

Mathematics Subject Classification ID

Computational learning theory (68Q32) Multistage and repeated games (91A20) Rationality and learning in game theory (91A26)

Cited In (1)

• Verified learning without regret. From algorithmic game theory to distributed systems with mechanized complexity guarantees

This page was built for publication: No-Φ-Regret: A Connection between Computational Learning Theory and Game Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261296)