BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260618T152931EDT-4776pBbIBg@132.216.98.100
DTSTAMP:20260618T192931Z
DESCRIPTION:Dynamic Games and Applications Seminar\n\nSpeaker: Margarida Ca
 rvalho – Department of Computer Science and Operations Research\, Universi
 té de Montréal\, Canada\n\nWebinar link\n	Webinar ID: 962 7774 9870\n	Passco
 de: 285404\n\nAbstract: In integer programming games\, players' feasible s
 trategies are described by lattice points inside polyhedra. This game repr
 esentation is natural when players' decisions have integrality restriction
 s. In this talk\, we will start by presenting practical examples of intege
 r programming games. Then\, we will focus on a particular 'dynamic' intege
 r programming game played over a graph\, the Multilevel Critical Node prob
 lem. Besides a discussion on the problem difficulty\, we will describe an 
 exact cutting plane algorithm to determine the game equilibrium and a rein
 forcement learning based heuristic to approximate it.\n
DTSTART:20210422T150000Z
DTEND:20210422T160000Z
LOCATION:CA\, ZOOM
SUMMARY:Interdiction games on graphs
URL:/cim/channels/event/interdiction-games-graphs-3305
 25
END:VEVENT
END:VCALENDAR