  We consider quantitative notions of parity automaton and parity game aimed at
modelling resource-aware behaviour, and study (memory-full) strategies for
exhibiting accepting runs that require a minimum amount of initial resources,
respectively for winning a game with minimum initial resources. We also show
how such strategies can be simplified to consist of only two types of moves:
the former aimed at increasing resources, the latter aimed at satisfying the
acceptance condition.

Logic in Computer Science;Computer Science and Game Theory