Faster algorithms for mean-payoff games-Reference-Cited by-同舟云学术

Faster algorithms for mean-payoff games

Published:2010-12-08 Issue:2 Volume:38 Page:97-118
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Methods Syst Des

Author:

Brim L.,Chaloupka J.,Doyen L.,Gentilini R.,Raskin J. F.

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s10703-010-0105-x.pdf

Reference23 articles.

1. Andersson D, Vorobyov S (2006) Fast algorithms for monotonic discounted linear programs with two variables per inequality. Preprint NI06019-LAA, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK

2. Bjorklund H, Vorobyov S (2007) A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Appl Math 155:210–229

3. LNCS;P Bouyer,2008

4. LNCS;A Chakrabarti,2003

5. Chaloupka J, Brim L (2009) Faster algorithm for mean-payoff games. In: Proc of the 5th docoral workshop on mathematical and engineering methods in computer science (MEMICS ’09). Novpress, pp 45–53

Cited by 87 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Optimal supervisory control of discrete event systems for cyclic tasks;Automatica;2024-06

3. Solving mean-payoff games via quasi dominions;Information and Computation;2024-03

4. Fast Algorithms for Energy Games in Special Cases;Electronic Proceedings in Theoretical Computer Science;2023-09-30

5. Fixpoint Theory -- Upside Down;Logical Methods in Computer Science;2023-06-07