A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Resource Packaging in Keyword Auctions
International Conference on Information Systems
Motivated by the enormous growth of keyword advertising, this paper studies how to package certain resources into shares for auctioning to maximize the auctioneer's expected revenue. We study such a problem in a unit-price auction setting where each bidder has private valuation for the shares, and the allocation of shares is determined by the rank-order of bidders' willingness-topay for per-unit resources. We investigate two facets of the resource packaging problem. First, when resources aredblp:conf/icis/ChenLW06 fatcat:cpnf234tuvcbpa47krahj753me