Average-Price-per-Reward Gameson Hybrid Automata with Strong Resets

摘要

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