A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games |
scientific article; zbMATH DE number 5128024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games |
scientific article; zbMATH DE number 5128024 |
Statements
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (English)
0 references
19 February 2007
0 references
mean payoff game
0 references
cyclic game
0 references
parity game
0 references
ergodic partition
0 references
combinatorial linear programming
0 references
longest shortest path
0 references
iterative improvement
0 references
randomized subexponential algorithm
0 references
0 references
0.9888800978660583
0 references
0.8431628346443176
0 references
0.8246371150016785
0 references
0.8138672113418579
0 references
