BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/850
DTSTAMP:20230914T125940Z
SUMMARY:Representation of Finite Games as Congestion Games
DESCRIPTION:Speaker: Phani Raj Lolakapuri\n\nAbstract: \nA congestion game 
 is a game where the cost of a player for using a resource depends on all t
 he players using that resource. Network congestion games are a natural mod
 el for situations where different individuals use resources in a network e
 .g.\, road networks\, data networks etc. Since every player have finite nu
 mber of strategies\, this is a finite game. In this talk\, we will show th
 at every finite game can be represented as a weighted congestion game. Thi
 s has been proved by Milchtaich.\n\nRef: Representation of finite games as
  congestion games - Milchtaich\n
URL:https://www.tcs.tifr.res.in/web/events/850
DTSTART;TZID=Asia/Kolkata:20180119T171500
DTEND;TZID=Asia/Kolkata:20180119T184500
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR