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 average-price 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.