Arrow Research search
Back to Highlights

Highlights 2019

Quasi Dominion Measures for Mean-Payoff Games

Conference Abstract Session 10: MEAN-PAYOFF GAMES, REACHABILITY GAMES, AND PATROLLING GAMES Logic in Computer Science · Theoretical Computer Science

Abstract

We propose a novel algorithm for the solution of mean-payoff games, which merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions can be highly beneficial and can significantly speed up convergence to the solution. Experiments point outs that the resulting algorithm performs orders of magnitude better than the best solution algorithm currently known.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
919108291340482118