BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/43
DTSTAMP:20230914T125907Z
SUMMARY:TIFR Cafeteria and Related Queues - A Game of Arrivals
DESCRIPTION:Speaker: Sandeep K. Juneja\nSchool of Technology and Computer S
 cience\nTata Institute of Fundamental Research\nHomi Bhabha Roa\n\nAbstrac
 t: \nIn this talk\, we introduce the `cafeteria or the banquet hall queuin
 g problem' strongly motivated by speaker's experience of waiting in the TI
 FR cafeteria queue: Fixed but a large number of users arrive into a queue 
 which provides service starting at a fixed time\, say\, 12:15 pm.  Users m
 ay (and some do) arrive before this time and queue up.  Their cost is a fu
 nction of their waiting time in the queue and time at which service is rec
 eived. We analyze this system in an asymptotic regime and develop fluid li
 mit for the resultant queuing system. The   limiting system may be modeled
  as a non-atomic game for which we determine the Nash-Wardrop equilibrium 
 arrival strategy under a variety of assumptions on the cost structure. Fur
 thermore\, we note that the `price of anarchy' of this system equals 2 und
 er linearity and homogeneity assumptions. We discuss some potential ways t
 o limit this\nanarchy.\n
URL:https://www.tcs.tifr.res.in/web/events/43
DTSTART;VALUE=DATE:20091111
LOCATION:AG-69
END:VEVENT
END:VCALENDAR