DROPS.MEMICS.2009.2348.pdf
- Filesize: 422 kB
- 9 pages
Document
Faster Algorithm for Mean-Payoff Games
Authors
-
Part of:
Volume:
Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09) (MEMICS 2009)
Series: Open Access Series in Informatics (OASIcs) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2009-12-15
Cite AsGet BibTex
Jakub Chaloupka and Luboš Brim. Faster Algorithm for Mean-Payoff Games. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 53-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DROPS.MEMICS.2009.2348
https://doi.org/10.4230/DROPS.MEMICS.2009.2348
Abstract
We study some existing techniques for solving mean-payoff games (MPGs),
improve them, and design a randomized algorithm for solving MPGs with
currently the best expected complexity.
Keywords
- Mean-payoff games
- randomized algorithms
- computational complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads