Pages that link to "Item:Q5875374"
From MaRDI portal
The following pages link to The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374):
Displaying 10 items.
- A symbolic shortest path algorithm for computing subgame-perfect Nash equilibria (Q747538) (← links)
- Subgame perfect implementation: A necessary and almost sufficient condition (Q909551) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Constrained existence of weak subgame perfect equilibria in multiplayer Büchi games (Q2203592) (← links)
- Subgame perfect implementation: a full characterization (Q2370493) (← links)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games (Q4913770) (← links)
- (Q5351977) (← links)
- Subgame-perfect Equilibria in Mean-payoff Games (journal version) (Q6178672) (← links)
- Computing the price of anarchy in atomic network congestion games (invited talk) (Q6536424) (← links)