Pages that link to "Item:Q2892777"
From MaRDI portal
The following pages link to Subgame Perfection for Equilibria in Quantitative Reachability Games (Q2892777):
Displaying 21 items.
- Network-formation games with regular objectives (Q342715) (← links)
- Subgame perfect implementation: A necessary and almost sufficient condition (Q909551) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Subgame perfection in recursive perfect information games (Q2061123) (← links)
- Timed network games (Q2112796) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- Subgame perfect implementation: a full characterization (Q2370493) (← links)
- Hierarchical Network Formation Games (Q3303895) (← links)
- (Q3384875) (← links)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games (Q4913770) (← links)
- Timed network games with clocks (Q5005123) (← links)
- (Q5111251) (← links)
- Infinite-Duration Bidding Games (Q5111634) (← links)
- (Q5140263) (← links)
- (Q5351977) (← links)
- (Q5856414) (← links)
- The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374) (← links)
- (Q5875381) (← links)
- On relevant equilibria in reachability games (Q5919688) (← links)