Faster algorithms for mean-payoff games
type: Item
instance of: scholarly article
title: Faster algorithms for mean-payoff games
zbMATH Open document ID: 1213.68430
author: Jakub Chaloupka
author: Laurent Doyen
author: Jean-François Raskin
author: Luboš Brim
author: Raffaella Gentilini
published in: Formal Methods in System Design
publication date: 2011-05-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 5898957
zbMATH Keywords: quantitative models
zbMATH Keywords: (quantitative) model checking
zbMATH Keywords: embedded systems
zbMATH Keywords: synthesis of controllers
zbMATH Keywords: quantitative games
zbMATH Keywords: mean-payoff objectives
zbMATH Keywords: energy constraints
zbMATH Keywords: algorithms \& complexity upper bounds
MaRDI profile type: Publication
full work available at URL: s10703-010-0105-x
OpenAlex ID: W2065595179
cites work: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints
cites work: Faster algorithm for mean-payoff games
cites work: Positional strategies for mean payoff games
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
cites work: Q4501540
cites work: Cyclical games with prohibitions
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q4002642
cites work: Q4298260
cites work: Mean cost cyclical games
cites work: From Parity and Payoff Games to Linear Programming
cites work: The complexity of mean payoff games on graphs
DOI: 10.1007/S10703-010-0105-X
description: scientific article; zbMATH DE number 5898957