Work

A pseudo-quasi-polynomial algorithm for mean-payoff parity games

Year: 2018

Type: conference-paper

Abstract: In a mean-payoff parity game, one of the two players aims both to achieve a qualitative parity objective and to minimize a quantitative long-term average of payoffs (aka. mean payoff). The game is zero-sum and hence the aim of the other player is to either foil the parity objective or to maximize the mean payoff.

Source: Proceedings - Symposium on Logic in Computer Science

DOI: 10.1145/3209108.3209162

Authors: Laure Daviaud, Martin Jurdziński, Ranko Lazić

Institution: University of Warwick

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Awards: G7279342223, Solving Parity Games in Theory and Practice