Positional Games and Randomness
summary
Focuses on positional games played on graphs and hypergraphs, exploring how randomness and deterministic structure affect players’ ability to achieve goals in games like Maker-Breaker, Avoider-Enforcer, and strong games. Describes methods linking probabilistic tools (random graph properties) with game-theoretic strategies to determine thresholds, winning tactics, and typical outcomes in these combinatorial games.
AI-written summary · about
chapters (23)
- 0:00Start
- 1:01Main goal
- 2:20Positional games - setting
- 4:21So what's the connection?
- 5:23Omnipresent randomness in positional games
- 9:29Basic setting (cont.)
- 11:59Unbiased Maker-Breaker games
- 14:25Maker-Breaker games -examples
- 17:29Erdos-Selfridge criterion-proof sketch
- 20:56This looks familiar...
- 22:16Erdös-Selfridge Criterion - application
- 24:58Maker-Breaker unbiased sames are frequently boring...
- 27:55Bias monotonicity, threshold bias
- 30:59So what is the threshold bias for...?
- 33:11Probabilistic intuition/Erdos paradigm
- 38:27Biased Hamiltonicity game-resolution
- 44:09Biased Hamiltonicity game - Maker's side (cont.)
- 46:27Large component game
- 50:12Games on random boards
- 53:17Unbiased Hamiltonicity game on G(np)
- 54:02Hamiltonicity game on G(np) - result
- 55:29Half-random games
- 57:08Hamiltonicity game with random Maker
