Parity games and their subclasses and variants pop up in various contexts: μ-calculus, tree automata, program verification [3, 1, 8]. Such games provide only binary information indicating the winning player. However, in classical games theory [12] the emphasis is rather on how much we win or lose. Can we incorporate the information about the profits and losses into parity games?