Sciweavers

50 search results - page 9 / 10
» Contract Auctions for Sponsored Search
Sort
View
WWW
2008
ACM
14 years 6 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
WINE
2009
Springer
194views Economy» more  WINE 2009»
14 years 6 days ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
WWW
2009
ACM
14 years 6 months ago
Bid optimization for broad match ad auctions
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 mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
AAAI
2011
12 years 5 months ago
On Expressing Value Externalities in Position Auctions
Externalities are recognized to exist in the sponsored search market, where two co-located ads compete for user attention. Existing work focuses on the effect of another ad on th...
Florin Constantin, Malvika Rao, Chien-Chung Huang,...
WWW
2010
ACM
14 years 18 days ago
How much is your personal recommendation worth?
Suppose you buy a new laptop and, simply because you like it so much, you recommend it to friends, encouraging them to purchase it as well. What would be an adequate price for the...
Paul Dütting, Monika Henzinger, Ingmar Weber