No--regret: a connection between computational learning theory and game theory

DOI10.1007/978-94-007-0714-6_7MaRDI QIDQ5261296zbMATH OpenOpenAlexFDO

Authors Amy Greenwald, Amir Jafari, Casey Marks

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)

Recommendations

• A general class of no-regret learning algorithms and game-theoretic equilibria.
• Learning, regret minimization, and equilibria
• No regrets about no-regret
• Near-optimal no-regret algorithms for zero-sum games
• Near-optimal no-regret algorithms for zero-sum games

Cited in

(6)

• Near-optimal no-regret algorithms for zero-sum games
• Verified learning without regret. From algorithmic game theory to distributed systems with mechanized complexity guarantees
• Hedging under uncertainty: regret minimization meets exponentially fast convergence
• No regrets about no-regret
• Near-optimal no-regret algorithms for zero-sum games
• A general class of no-regret learning algorithms and game-theoretic equilibria.

This page was built for publication: No-\(\Phi\)-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)