The GKK algorithm is the fastest over simple mean-payoff games
type: Item
instance of: scholarly article
title: The GKK algorithm is the fastest over simple mean-payoff games
DOI: 10.1007/978-3-031-09574-0_17
author: Pierre Ohlmann
publication date: 2022-11-11T00:00:00Z
full work available at URL: https://arxiv.org/abs/2110.04533
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7615743
zbMATH Keywords: mean-payoff games
zbMATH Keywords: symmetric algorithm
zbMATH Keywords: GKK algorithm
zbMATH Keywords: pseudopolynomial
MaRDI profile type: Publication
OpenAlex ID: W3206569936
cites work: Combinatorial structure and randomized subexponential algorithms for infinite games
cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints
cites work: Faster algorithms for mean-payoff games
cites work: Deciding parity games in quasipolynomial time
cites work: Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
cites work: Q5091276
cites work: Positional strategies for mean payoff games
cites work: Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
cites work: Maximum-Minimum Sätze über Graphen
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: Borel determinacy
cites work: Mean cost cyclical games
cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees
cites work: The complexity of mean payoff games on graphs
description: scientific article; zbMATH DE number 7615743