AG 1   Info

AG Audience

English

30 Minutes

Saarbrücken

In combinatorial auctions we have a number of subsets of items of a set S that is auctioned to bidders who express their preferences on them. We want to find a maximum cost subcollection of sets which are pair-wise disjoint. Since the problem is intractable, we study algorithms which approximate the problem with a good approximation ratio and are also truthful. Since the best approximation know cannot get better than sqrt(m) we study some special cases of graphs in which we can achieve a better approximation. Next we study sponsored search auctions, a special case of combinatorial auctions.

We study the allocation mechanisms and payment models. We continue with the prediction of Click Through Rate and we see how we can improve the expected error in its estimation.

Rob van Stee

--email hidden

passcode not visible

logged in users only