Pages that link to "Item:Q5311141"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311141):
Displaying 18 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)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Average-energy games (Q2413482) (← links)
- Computing Game Values for Crash Games (Q3510795) (← links)
- (Q5013874) (← links)
- (Q5013875) (← links)
- (Q5021006) (← links)
- (Q5028465) (← links)
- (Q5089289) (← links)
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions (Q5090979) (← links)
- Exploiting Game Theory for Analysing Justifications (Q5140022) (← links)
- Continuous Positional Payoffs (Q6135780) (← links)
- Submixing and shift-invariant stochastic games (Q6183353) (← links)
- Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs (Q6566586) (← links)
- On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations (Q6573335) (← links)
- Half-positional objectives recognized by deterministic Büchi automata (Q6597970) (← links)
