Near-optimal no-regret algorithms for zero-sum games (Q2516247)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6472211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal no-regret algorithms for zero-sum games |
scientific article; zbMATH DE number 6472211 |
Statements
Near-optimal no-regret algorithms for zero-sum games (English)
0 references
12 August 2015
0 references
zero-sum games
0 references
repeated games
0 references
learning
0 references
no-regret dynamics
0 references
0.977916955947876
0 references
0.8071358799934387
0 references
0.7982842922210693
0 references
0.7799695730209351
0 references
0.7747466564178467
0 references
