Combinatorial Simplex Algorithms Can Solve Mean Payoff Games (Q5245379): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q117245052, #quickstatements; #temporary_batch_1711486624475 |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1309.5925 / rank | |||
Normal rank | |||
Latest revision as of 01:18, 20 April 2024
scientific article; zbMATH DE number 6423426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial Simplex Algorithms Can Solve Mean Payoff Games |
scientific article; zbMATH DE number 6423426 |
Statements
Combinatorial Simplex Algorithms Can Solve Mean Payoff Games (English)
0 references
8 April 2015
0 references
tropical geometry
0 references
linear programming
0 references
mean payoff games
0 references
symbolic perturbation
0 references
Hahn series
0 references
real closed fields
0 references
