Sciweavers

41 search results - page 3 / 9
» Optimal Auctions Capturing Constraints in Sponsored Search
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 9 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 10 months ago
A Truthful Mechanism for Offline Ad Slot Scheduling
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time. Advertisers specify a budget constr...
Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, M...
WWW
2010
ACM
14 years 4 months ago
Expressive auctions for externalities in online advertising
When online ads are shown together, they compete for user attention and conversions, imposing negative externalities on each other. While the competition for user attention in spo...
Arpita Ghosh, Amin Sayedi
WWW
2008
ACM
14 years 10 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
WWW
2009
ACM
14 years 10 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...