BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//project/author//NONSGML v1.0//EN
CALSCALE:GREGORIAN
BEGIN:VEVENT
DTEND:20220901T120000Z
UID:3feaa69b3b3e4e8cf0476dfccaae1336-324
DTSTAMP:19700101T120018Z
DESCRIPTION:Robust Secretary Algorithms for Packing Integer Programs
URL;VALUE=URI:https://www.csa.iisc.ac.in/newweb/event/324/robust-secretary-algorithms-for-packing-integer-programs/
SUMMARY:We study the problem of solving Packing Integer Programs (PIPs) in the online setting, where columns in [0,1]^d of the constraint matrix are revealed sequentially, and the goal is to pick a subset of the columns that sum to at most B in each coordinate while maximizing the objective. E.g., this problem captures the Online Knapsack problem when d=1. Excellent results are known for PIPs in the secretary model, where the columns are adversarially chosen but presented in a uniformly random order. However, these existing algorithms are susceptible to adversarial attacks: they try to
DTSTART:20220901T120000Z
END:VEVENT
END:VCALENDAR