Pages that link to "Item:Q5311141"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311141):
Displaying 7 items.
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- (Q5089289) (← links)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
- Continuous Positional Payoffs (Q6135780) (← links)
- Submixing and shift-invariant stochastic games (Q6183353) (← links)
