Sciweavers

60 search results - page 9 / 12
» Optimizing auctioneer's revenues in expanding multi-unit auc...
Sort
View
WWW
2007
ACM
14 years 9 months ago
Dynamics of bid optimization in online advertisement auctions
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to o...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
WWW
2008
ACM
14 years 9 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...
INFOCOM
2011
IEEE
13 years 7 days ago
To preempt or not: Tackling bid and time-based cheating in online spectrum auctions
—Online spectrum auctions offer ample flexibility for bidders to request and obtain spectrum on-the-fly. Such flexibility, however, opens up new vulnerabilities to bidder mani...
Lara B. Deek, Xia Zhou, Kevin C. Almeroth, Haitao ...
MAGS
2010
153views more  MAGS 2010»
13 years 3 months ago
Designing bidding strategies in sequential auctions for risk averse agents
Designing efficient bidding strategies for sequential auctions remains an important, open problem area in agent-mediated electronic markets. In existing literature, a variety of bi...
Valentin Robu, Han La Poutré
CORR
2008
Springer
170views Education» more  CORR 2008»
13 years 8 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
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...
Sudhir Kumar Singh, Vwani P. Roychowdhury