Ã山ǿ¼é

Dynamic Games and Applications Seminar

Speaker:  – Department of Computer Science and Operations Research, Université de Montréal, Canada

Webinar ID: 962 7774 9870
Passcode: 285404

Abstract: In integer programming games, players' feasible strategies are described by lattice points inside polyhedra. This game representation is natural when players' decisions have integrality restrictions. In this talk, we will start by presenting practical examples of integer programming games. Then, we will focus on a particular "dynamic" integer programming game played over a graph, the Multilevel Critical Node problem. Besides a discussion on the problem difficulty, we will describe an exact cutting plane algorithm to determine the game equilibrium and a reinforcement learning based heuristic to approximate it.