National Workshop on Algorithmic Combinatorial Game Theory
(NWACGT 2024)

Objective of the workshop

The NWACGT 2024 will be conducted with the aim of providing basic inputs on following topics in Game Theory – Combinatorial games, Nim Game and Bouton’s solution of Nim, The game of Hex and Gale’s solution, Game of Hex and the Brouwer’s fixed point theorem, Two-person zero-sum normal form games and the geometry of convex sets, The Minimax Theorem and its meaning, Simplifying and solving zero-sum games, Completely mixed games. Pure optimal strategies: Saddle points, von Neumann’s Minimax Theorem, Zero-sum games with infinite action spaces, Statistical decision functions, Basic feasible solutions and the simplex method for solving matrix games, Bimatrix games and Nash equilibria in mixed strategies, Repeated games, folk theorem and equilibria via threat strategies, Marriage and matchmaking, Stable matching and allocation, Algorithms for finding stable matchings, Cooperative TU games, The core, The Shapley value, Shapley’s axioms, Shapley’s Theorem, Nash bargaining, Nucleolus, Assignment games, Permutation matrices, Birkhoff von Neumann Theorem, Frobenius Konig’s Theorem, Applications to optimal assignment problems, Algorithm to solve for the nucleolus in assignment games.

The course will be delivered through lectures on the topic in-depth and tutorials.