BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Optimal Transport for Concave Cost Functions
DTSTART:20260401T083000Z
DTEND:20260401T100000Z
DTSTAMP:20260409T132700Z
UID:indico-event-16361@indico.math.cnrs.fr
DESCRIPTION:Speakers: Grigorii Buklei (GSSI L’Aquila)\n\nIn a pizza deli
 very scenario\, we have n points x_1\, …\, x_n (couriers) and y_1\, …\
 , y_n (customers) on a line\, and we want to match them so that the total 
 delivery cost is minimised. Motivated by economic considerations\, we will
  consider the case where the cost of a matching is concave in the distance
 \, say |x-y|^p for p \\in (0\,1). Different cost functions of this type ca
 n impose different optimal courier assignments. The goal of the talk is to
  discuss how to obtain quantitative bounds on this number. Time permitting
 \, I will also touch on other OT-related projects I am working on.\n\nhttp
 s://indico.math.cnrs.fr/event/16361/
LOCATION:112 (Braconnier )
URL:https://indico.math.cnrs.fr/event/16361/
END:VEVENT
END:VCALENDAR