scientific article
From MaRDI portal
Publication:3234879
zbMath0073.13204MaRDI QIDQ3234879
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Empirical Bayes stock market portfolios ⋮ On a Unified Framework for Approachability with Full or Partial Monitoring ⋮ Approachability with bounded memory ⋮ Approachability of convex sets in generalized quitting games ⋮ No-regret algorithms in on-line learning, games and convex optimization ⋮ A conversation with James Hannan ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Regret minimization in repeated matrix games with variable stage duration ⋮ Probabilistic interpretations of integrability for game dynamics ⋮ Randomized prediction of individual sequences ⋮ Unnamed Item ⋮ Note on universal conditional consistency ⋮ A general class of adaptive strategies ⋮ Stable games and their dynamics ⋮ The compound decision problem in the opponent case ⋮ An extension of play against the random past strategy. Choosing the right experts on IBM forecasts ⋮ 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 ⋮ If multi-agent learning is the answer, what is the question? ⋮ Identification and Prediction ⋮ Payoff performance of fictitious play
This page was built for publication:
