scientific article; zbMATH DE number 3122013
From MaRDI portal
Publication:3234879
Cited in
(25)- If multi-agent learning is the answer, what is the question?
- Empirical Bayes stock market portfolios
- Approachability of convex sets in generalized quitting games
- Randomized prediction of individual sequences
- Special issue: Learning in games: a symposium in honor of David Blackwell.
- Regret in the on-line decision problem
- Conditional universal consistency.
- An easier way to calibrate.
- Minimizing regret: The general case
- Stable games and their dynamics
- Approachability with bounded memory
- Approachability, regret and calibration: implications and equivalences
- The compound decision problem in the opponent case
- Payoff performance of fictitious play
- Identification and Prediction
- On a unified framework for approachability with full or partial monitoring
- Probabilistic interpretations of integrability for game dynamics
- scientific article; zbMATH DE number 7626715 (Why is no real title available?)
- An extension of play against the random past strategy. Choosing the right experts on IBM forecasts
- Note on universal conditional consistency
- A general class of adaptive strategies
- No-regret algorithms in on-line learning, games and convex optimization
- Adversarial laws of large numbers and optimal regret in online classification
- A conversation with James Hannan
- Regret minimization in repeated matrix games with variable stage duration
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3234879)
