Pages that link to "Item:Q5357711"
From MaRDI portal
The following pages link to To reach or not to reach? Efficient algorithms for total-payoff games (Q5357711):
Displaying 7 items.
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- Extending finite-memory determinacy to multi-player games (Q1641036) (← links)
- Probabilistic causes in Markov chains (Q2147196) (← links)
- Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
- (Q5021006) (← links)
- (Q5101350) (← links)
- Alternating Reachability Games with Behavioral and Revenue Objectives (Q5222974) (← links)