Approachability in repeated games: Computational aspects and a Stackelberg variant (Q1021600)
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 5562816
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approachability in repeated games: Computational aspects and a Stackelberg variant |
scientific article; zbMATH DE number 5562816 |
Statements
Approachability in repeated games: Computational aspects and a Stackelberg variant (English)
0 references
8 June 2009
0 references
0.8570000529289246
0 references
0.8086564540863037
0 references
0.8068814277648926
0 references
0.804728627204895
0 references
0.7942484021186829
0 references
