Average-Price-per-Reward Games on Hybrid Automata with Strong Resets

We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability results by a translation to a novel class of finite graphs with price and reward information, and games assigned to edges. The cost and reward of following an edge are determined by the outcome of the edge game that is assigned to it.

• Type: Conference
• Year: 2009
• Where: VMCAI
• Authors: Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski
• Keywords: Hybrid Automata, Price-per-reward Games, Software Engineering, Strong Resets, VMCAI 2009