Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability

摘要

We study n-player turn-based games played on a finite directed graph. For each play, the players have to pay a cost that they want to minimize. Instead of the well-known notion of Nash equilibrium (NE), we focus on the notion of subgame perfect equilibriu