BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/655
DTSTAMP:20230914T125933Z
SUMMARY:Computing Equilibria in Atomic Splittable Routing Games
DESCRIPTION:Speaker: Phani Raj Lolakapuri\n\nAbstract: \nAbstract: An atomi
 c splittable routing game (ASRG) is a network congestion problem where eac
 h player has some finite amount of flow he wants to send in the network\, 
 while minimizing his cost.\n\nIt has been known that equilibrium exists in
  ASRG games. But computing the equilibrium for ASRG has been an open probl
 em for many years.\n\nIn this report we give an algorithm for finding the 
 equilibrium when the underlying network is parallel edge graph with linear
  latencies. Our algorithm is similar to an earlier algorithm by Huang [The
 ory Comp. Sys.\, 2013]\, but uses a modified support enumeration step.\n\n
 Next we give an algorithm for finding the equilibrium for two player ASRG 
 when the underlying network is a parallel-edge graph with quadratic latenc
 ies. Our algorithm is obtained by using support enumeration\, along with c
 onvex programming and results about the structure of equilibrium with quad
 ratic latencies. We assume in this report that exact solutions to convex p
 rograms and binary searches can be obtained in polynomial time.\n
URL:https://www.tcs.tifr.res.in/web/events/655
DTSTART;TZID=Asia/Kolkata:20160208T160000
DTEND;TZID=Asia/Kolkata:20160208T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR