In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
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...
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...
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...
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...