À¶Ý®ÊÓƵ

Title: : Optimal Item Pricing in Online Combinatorial Auctions

Abstract: I will present a paper by Correa, Cristi, Fielbaum, Pollner, and Weinberg. The paper studies the online combinatorial auction problem when buyers are interested in sets of size at most d. They show that there exist item prices such that the posted price mechanism under these prices results in an allocation that is (d+1)-approximate with respect to the offline benchmark. They show the existence of these prices through a novel use of Brouwer's fixed point theorem.