Looking at Mean-Payoff and Total-Payoff through Windows

DOI10.1007/978-3-319-02444-8_10zbMath1415.91065arXiv1302.4248OpenAlexW1504110970MaRDI QIDQ5166680

Mickael Randour, Krishnendu Chatterjee, Laurent Doyen, Jean-François Raskin

Publication date: 8 July 2014

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.4248

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Looking at mean payoff through foggy windows ⋮ The complexity of multi-mean-payoff and multi-energy games ⋮ Looking at mean-payoff and total-payoff through windows

This page was built for publication: Looking at Mean-Payoff and Total-Payoff through Windows