40 citations · 79 across the 9 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DS2009★ 40 cited
Online Stochastic Matching: Beating 1-1/e
Jon Feldman, Aranyak Mehta, Vahab Mirrokni +1
We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result…
cs.GT2009★ 9 cited
Bid Optimization in Broad-Match Ad auctions
Eyal Even-dar, Yishay Mansour, Vahab Mirrokni +2
Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expr…