# Subgame-perfect Equilibria in Mean-payoff Games (journal version)

arXiv: https://arxiv.org/abs/2203.08546 · HTML: https://mlsanity.com/paper/2203.08546/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Mar 2022.

## Built on by (most cited first, 1 of 1)

- [Synthesis of Reward Machines for Multi-Agent Equilibrium Design (Full Version)](https://mlsanity.com/paper/2408.10074/) (2024)

## Abstract (arXiv)

In this paper, we provide an effective characterization of all the subgame-perfect equilibria in infinite duration games played on finite graphs with mean-payoff objectives. To this end, we introduce the notion of requirement, and the notion of negotiation function. We establish that the plays that are supported by SPEs are exactly those that are consistent with a fixed point of the negotiation function. Finally, we use that characterization to prove that the SPE threshold problem, who status was left open in the literature, is decidable.