An Improved Upper Bound on Time Complexity of Value Problem and Optimal Strategy Synthesis in MPGs.

We prove the existence of a pseudo-polynomial O(|V|^2 |E|\, W) time algorithm for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. This improves by a factor log(|V|\, W) the best previously known pseudo-polynomial upper bound due to Brim et al. (2011). The improvement hinges on a suitable characterization of values and optimal strategies in terms of reweightings.
Download link: manuscript.
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s