SubjectsSubjects(version: 845)
Course, academic year 2019/2020
   Login via CAS
Algorithmic game theory and poker - NOPT055
Title in English: Algoritmická teorie her a poker
Guaranteed by: Department of Applied Mathematics (32-KAM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2016
Semester: winter
E-Credits: 3
Hours per week, examination: winter s.:2/0 Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: not taught
Language: Czech
Teaching methods: full-time
Guarantor: Mgr. Martin Schmid
Mgr. Matej Moravčík
doc. Mgr. Milan Hladík, Ph.D.
Classification: Informatics > Optimalization
Annotation -
Last update: doc. Mgr. Milan Hladík, Ph.D. (06.05.2014)
The most important concepts of the game theory are introduced. Students will learn the theory to understand how the state-of-the art algorithms for the games with imperfect information, such as card games. Later, the course focuses on these games, such as Poker. Students will understand how the best Poker programs in the world work, including the strong and weak parts. The course also shows the application of math optimization and suggests another classes for better understanding of the concepts involved.
Literature -
Last update: doc. Mgr. Milan Hladík, Ph.D. (06.05.2014)

[1] Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani: Algorithmic Game Theory, Cambridge University Press, 2007.

[2] http://poker.cs.ualberta.ca/publications.html

[3] Martin Schmid: Game Theory and Poker, diplomová práce, MFF UK, 2013.

Syllabus -
Last update: doc. Mgr. Milan Hladík, Ph.D. (06.05.2014)

1) Game theory models, strategies

  • matrix games
  • continuous games
  • stochastic game
  • extensive form games

2) Nash equilibrium 1

  • optimality
  • optimality vs best response

3) Nash equilibrium 2

  • Existence/non existence

4) Complexity

  • Polynomial cases
  • PPAD, NP

5) Poker 1

  • Game introduction
  • Formalization of Poker
  • Simple poker-like games

6) Poker 2

  • Heads up push-fold game
  • Tournaments

7) Regret

  • Introduction
  • Regret matching
  • CFR
  • Monte carlo CFR
  • Sampling principle
  • Sampling variants

8) Game abstractions

  • Lossless abstractions
  • Imperfect recall abstractions
  • Overfitting

9) Poker abstractions

  • Card abstractions
  • Betting abstractions

10) Annual Computer Poker Competition

 
Charles University | Information system of Charles University | http://www.cuni.cz/UKEN-329.html