Pages that link to "Item:Q5891525"
From MaRDI portal
The following pages link to Deterministic graphical games revisited (Q5891525):
Displaying 15 items.
- Determining the results of tournament games using complete graphs generation (Q1715680) (← links)
- A three-person deterministic graphical game without Nash equilibria (Q1752440) (← links)
- Winner determination algorithms for graph games with matching structures (Q2169988) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Determinacy of adversarial Gowers games (Q3188941) (← links)
- (Q3390731) (← links)
- (Q4347879) (← links)
- (Q4601879) (← links)
- Recursive comparison tests for dicot and dead-ending games under misère play (Q5041715) (← links)
- (Q5247252) (← links)
- EVALUATING DETERMINISTIC POLICIES IN TWO-PLAYER ITERATED GAMES (Q5306402) (← links)
- SURE WAY TO WIN A GAME USING A MUTUALLY DEPENDENT DECISION PROCESS MODEL (Q5365656) (← links)
- Games solved: Now and in the future (Q5958209) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)