Minimax
Top View
- Combinatorial Games
- Memoryless Determinacy of Parity and Mean Payoff Games
- Solving Zero-Sum Extensive-Form Games with Arbitrary Payoff
- CMSC 474, Introduction to Game Theory 1. Introduction
- Minimax Analysis of Active Learning
- Exact and Monte-Carlo Algorithms for Combinatorial Games
- COMBINATORIAL GAME THEORY in CLOBBER Jeroen Claessen
- The Determinacy of Infinite Games with Eventual Perfect Monitoring
- Introduction to Game Theory
- Lecture 10: Games II Question Review: Minimax Review
- Characterization of Group-Strategyproof Mechanisms for Facility Location in Strictly Convex Space
- A Pruning Algorithm for Imperfect Information Games
- Chapter 6: Adversarial Search
- Alpha-Beta Pruning
- CMSC 474, Introduction to Game Theory 1. Introduction
- Multi-Player Alpha-Beta Pruning
- Midterm Solutions
- Rationalizable Strategies in Games with Incomplete Preferences