Pages that link to "Item:Q520343"
From MaRDI portal
The following pages link to Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343):
Displaying 7 items.
- Computing branching distances with quantitative games (Q2210522) (← links)
- Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
- Reaching Your Goal Optimally by Playing at Random with No Memory (Q5089292) (← links)
- Symbolic Approximation of Weighted Timed Games (Q5090965) (← links)
- (Q5101350) (← links)
- On relevant equilibria in reachability games (Q5919688) (← links)
- Optimal controller synthesis for timed systems (Q6135744) (← links)
