Hyperplane Separation Technique for Multidimensional Mean-Payoff Games

DOI10.1007/978-3-642-40184-8_35zbMath1371.68106arXiv1210.3141OpenAlexW1818968539MaRDI QIDQ2842129

Krishnendu Chatterjee, Yaron Velner

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Hyperplane separation technique for multidimensional mean-payoff games ⋮ Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time ⋮ Graph Games and Reactive Synthesis ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Quantitative fair simulation games ⋮ The complexity of multi-mean-payoff and multi-energy games

This page was built for publication: Hyperplane Separation Technique for Multidimensional Mean-Payoff Games