Faster algorithms for mean-payoff games

From MaRDI portal
Publication:537946

DOI10.1007/s10703-010-0105-xzbMath1213.68430OpenAlexW2065595179MaRDI QIDQ537946

Laurent Doyen, Jean-François Raskin, J. Chaloupka, Luboš Brim, Raffaella Gentilini

Publication date: 23 May 2011

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-010-0105-x




Related Items (44)

Hyperplane separation technique for multidimensional mean-payoff gamesThe Theory of Universal Graphs for Infinite Duration GamesLooking at mean payoff through foggy windowsGraph Games and Reactive SynthesisProtocol schedulingUSING STRATEGY IMPROVEMENT TO STAY ALIVEIncentive Stackelberg Mean-Payoff GamesThe Complexity of Infinitely Repeated Alternating Move GamesInstantaneous reaction-time in dynamic consistency checking of conditional simple temporal networksSafraless LTL synthesis considering maximal realizabilityAverage-energy gamesUnnamed ItemAutomated competitive analysis of real-time scheduling with graph gamesEnforcing opacity by insertion functions under multiple energy constraintsSolving mean-payoff games via quasi dominionsChecking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithmHyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff gamesUnnamed ItemUnnamed ItemUnnamed ItemA note on the approximation of mean-payoff gamesBounding Average-Energy GamesDown the Borel hierarchy: solving Muller games via safety gamesPolynomial-time algorithms for energy games with special weight structuresFixpoint theory -- upside downReactive synthesis without regretPseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability gamesSolving Mean-Payoff Games via Quasi DominionsImproved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff gamesMeet your expectations with guarantees: beyond worst-case synthesis in quantitative gamesEnergy parity gamesUnnamed ItemA general approach for optimizing dynamic sensor activation for discrete event systemsQuantitative reductions and vertex-ranked infinite gamesOn Solving Mean Payoff Games Using Pivoting AlgorithmsUnnamed ItemUnnamed ItemDynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and DerandomizationSupervisor synthesis and throughput optimization of partially-controllable manufacturing systemsValue Iteration Using Universal Graphs and the Complexity of Mean Payoff GamesThe GKK algorithm is the fastest over simple mean-payoff gamesThe complexity of multi-mean-payoff and multi-energy gamesQualitative analysis of concurrent mean-payoff gamesLooking at mean-payoff and total-payoff through windows



Cites Work




This page was built for publication: Faster algorithms for mean-payoff games