Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W05
@@ Property / Mathematics Subject Classification ID: 68W05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+A43
@@ Property / Mathematics Subject Classification ID: 91A43 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6710366
@@ Property / zbMATH DE Number: 6710366 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mean payoff games
@@ Property / zbMATH Keywords: mean payoff games / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+value problem
@@ Property / zbMATH Keywords: value problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+optimal strategy synthesis
@@ Property / zbMATH Keywords: optimal strategy synthesis / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+pseudo-polynomial time
@@ Property / zbMATH Keywords: pseudo-polynomial time / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+energy games
@@ Property / zbMATH Keywords: energy games / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+small energy-progress measures
@@ Property / zbMATH Keywords: small energy-progress measures / rank @@
+Normal rank

Revision as of 06:13, 1 July 2023