Pages that link to "Item:Q3637359"
From MaRDI portal
The following pages link to Time-Optimal Winning Strategies for Poset Games (Q3637359):
Displaying 8 items.
- Down the Borel hierarchy: solving Muller games via safety games (Q477197) (← links)
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game (Q725767) (← links)
- On equilibria in quantitative games with reachability/safety objectives (Q1678747) (← links)
- Time-aware uniformization of winning strategies (Q2106605) (← links)
- Multiplayer Cost Games with Simple Nash Equilibria (Q3455836) (← links)
- Time-Optimal Winning Strategies for Poset Games (Q3637359) (← links)
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (Q5326586) (← links)