Sciweavers

Share
16 search results - page 1 / 4
» Computing Optimal Bundles for Sponsored Search
Sort
View
WINE
2007
Springer
151views Economy» more  WINE 2007»
11 years 11 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
11 years 9 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
ICAI
2004
11 years 6 months ago
An Efficient Heuristic Bundle Search Algorithm for Buyers in Electronic Markets
In the age of electronic commerce, with low-cost information access, it has been recognized that a bundle search in a combinatorial trade is very valuable for buyers. Optimal trav...
Linli He, Thomas R. Ioerger
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
11 years 9 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
ATAL
2010
Springer
11 years 6 months ago
TacTex09: a champion bidding agent for ad auctions
In the Trading Agent Competition Ad Auctions Game, agents compete to sell products by bidding to have their ads shown in a search engine's sponsored search results. We report...
David Pardoe, Doran Chakraborty, Peter Stone
books