Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
We study prophet inequalities under intersections of partition matroids, where an online algorithm irrevocably selects elements with independent nonnegative values drawn from k…
cs.GT2025
Online Resource Allocation via Static Bundle Pricing
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
Online Resource Allocation addresses the problem of efficiently allocating limited resources to buyers with incomplete knowledge of future requests. In our setting, buyers arrive s…