BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Vrije Universiteit Amsterdam//NONSGML v1.0//EN
NAME:Tim Oosterwijk: Bicriteria Nash Flows over Time
METHOD:PUBLISH
BEGIN:VEVENT
DTSTART:20260415T160000
DTEND:20260415T170000
DTSTAMP:20260415T160000
UID:tim-oosterwijk-bicriteria-nash@8F96275E-9F55-4B3F-A143-836282E12573
CREATED:20260915T093935
LOCATION:VU Main Building, 1105, De Boelelaan, 1081 HV, Amsterdam
SUMMARY:Tim Oosterwijk: Bicriteria Nash Flows over Time
X-ALT-DESC;FMTTYPE=text/html: <html> <body> <p><p>In this seminar, Tim
  Oosterwijk will give a talk about Bicriteria Nash Flows over Time.</
 p></p> <p>Flows over time are a natural way to incorporate flow dynam
 ics that arise in various applications such as traffic networks. In t
 his talk we introduce a natural variant of the deterministic fluid qu
 euing model in which users aim to minimize their costs subject to arr
 ival at their destination before a pre-specified deadline. We determi
 ne the existence and the structure of Nash flows over time and fully 
 characterize the price of anarchy for this model. The price of anarch
 y measures the ratio of the quality of the equilibrium and the qualit
 y of the optimum flow, where we evaluate the quality using two differ
 ent natural performance measures: the throughput for a given deadline
  and the makespan for a given amount of flow. While it turns out that
  both prices of anarchy can be unbounded in general, we provide tight
  bounds for the important subclass of parallel path graphs.</p> </bod
 y> </html>
DESCRIPTION: In this seminar, Tim Oosterwijk will give a talk about Bi
 criteria Nash Flows over Time. Flows over time are a natural way to i
 ncorporate flow dynamics that arise in various applications such as t
 raffic networks. In this talk we introduce a natural variant of the d
 eterministic fluid queuing model in which users aim to minimize their
  costs subject to arrival at their destination before a pre-specified
  deadline. We determine the existence and the structure of Nash flows
  over time and fully characterize the price of anarchy for this model
 . The price of anarchy measures the ratio of the quality of the equil
 ibrium and the quality of the optimum flow, where we evaluate the qua
 lity using two different natural performance measures: the throughput
  for a given deadline and the makespan for a given amount of flow. Wh
 ile it turns out that both prices of anarchy can be unbounded in gene
 ral, we provide tight bounds for the important subclass of parallel p
 ath graphs.
END:VEVENT
END:VCALENDAR
