BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/922
DTSTAMP:20230914T125943Z
SUMMARY:Complexity of Constant Player Potential Game
DESCRIPTION:Speaker: Vidya Sagar Sharma\n\nAbstract: \nAbstract: It is well
  known that multi-player potential game is PLS-complete.We show that cons
 tant player potential game is also PLS-complete.We also show that\,there 
 exist a constant-player potential game with some initial strategy such th
 at it can take exponential time to reach Nash-equilibrium.We also give a 
 polynomial time algorithm to get Nash-equilibrium in the network congesti
 on game in the case of directed acyclic graph.\n
URL:https://www.tcs.tifr.res.in/web/events/922
DTSTART;TZID=Asia/Kolkata:20181130T171500
DTEND;TZID=Asia/Kolkata:20181130T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR