Pages that link to "Item:Q1818283"
From MaRDI portal
The following pages link to Regret in the on-line decision problem (Q1818283):
Displayed 24 items.
- Regret minimization in repeated matrix games with variable stage duration (Q926893) (← links)
- Exponential weight algorithm in continuous time (Q959954) (← links)
- Learning by trial and error (Q1007782) (← links)
- If multi-agent learning is the answer, what is the question? (Q1028919) (← links)
- Agendas for multi-agent learning (Q1028923) (← links)
- The possible and the impossible in multi-agent learning (Q1028928) (← links)
- A hierarchy of prescriptive goals for multiagent learning (Q1028932) (← links)
- Predicting a binary sequence almost as well as the optimal biased coin (Q1398365) (← links)
- Learning, hypothesis testing, and Nash equilibrium. (Q1413211) (← links)
- Strategic learning in games with symmetric information. (Q1811548) (← links)
- A wide range no-regret theorem (Q1811553) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- Conditional universal consistency. (Q1818287) (← links)
- Minimizing regret: The general case (Q1818295) (← links)
- Stable games and their dynamics (Q2271376) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Learning correlated equilibria in games with compact sets of strategies (Q2371157) (← links)
- Online calibrated forecasts: memory efficiency versus universality for learning in games (Q2384142) (← links)
- A general criterion and an algorithmic framework for learning in multi-agent systems (Q2384145) (← links)
- Approachability with bounded memory (Q2389319) (← links)
- Deterministic calibration and Nash equilibrium (Q2462508) (← links)
- Internal regret in on-line portfolio selection (Q5916205) (← links)
- Internal regret in on-line portfolio selection (Q5921688) (← links)
- A general class of adaptive strategies (Q5938632) (← links)