Stochastic Games with Parity Mean-payoff Objective

In this paper, we compute value of two-player games with perfect information equipped with the parity and mean pay-off objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almost-sure region.

Data and Resources

Stochastic Games with Parity Mean-payoff ObjectiveHTML
Explore
- More information
- Go to resource

Additional Info

Field	Value
Source	https://hal.science/hal-00766251
Author	Chatterjee, Krishnendu, Doyen, Laurent, Gimbert, Hugo, Oualhadj, Youssouf
Maintainer	CCSD
Last Updated	May 30, 2026, 14:46 (UTC)
Created	May 30, 2026, 14:46 (UTC)
Identifier	hal-00766251
Language	en
Rights	https://about.hal.science/hal-authorisation-v1/
contributor	Institute of Science and Technology [Klosterneuburg, Austria] (IST Austria)
creator	Chatterjee, Krishnendu
date	2012-11-12T00:00:00
harvest_object_id	be51b349-f236-4170-b135-505a05ed692a
harvest_source_id	3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title	test moissonnage SELUNE
metadata_modified	2025-05-26T00:00:00
set_spec	type:REPORT