Speaker:

Yu Cong (University of Electronic Science and Technology of China)

Time:

• 16:20-17:20 (Time in Beijing)
• May 19, 2023 (Friday)

Venue:

518, Research Building 4

Abstract:

We consider a large-scale incentive allocation problem where the entire trade-off curve between budget and profit has to be maintained approximately at all time. The application originally comes from assigning coupons to users of the ride-sharing apps, where each user can have a limit on the number of coupons been assigned. We consider a more general form, where the coupons for each user forms a matroid, and the coupon assigned to each user must be an independent set. We show the entire trade-off curve can be maintained approximately in near-real time.