4 papers · 1 filter
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…
Repeated Descent: A Framework for Online Budget-Feasible Auctions
Andreas Charalampopoulos, Dimitris Fotakis, Thanos Tolias
We study budget feasible procurement auctions, in which agents, each with a privately held service cost, offer their services to an employer. The employer seeks to maximize a p…
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…
A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
Andreas Charalampopoulos, Dimitris Fotakis, Panagiotis Patsilinakos +1
We consider online procurement auctions, where the agents arrive sequentially, in random order, and have private costs for their services. The buyer aims to maximize a monotone sub…