Please use this identifier to cite or link to this item:
Nazerzadeh, Hamid
Saberi, Amin
Vohra, Rakesh V.
Year of Publication: 
Series/Report no.: 
Discussion Paper 1450
We examine the problem of allocating a resource repeatedly over time amongst a set of agents. The utility that each agent derives from consumption of the item is private information to that agent and, prior to consumption may be unknown to that agent. The problem is motivated by keyword auctions, where the resource to be allocated is a slot on a search page. We describe a mechanism based on a sampling-based learning algorithm that under suitable assumptions is asymptotically individually rational, asymptotically Bayesian incentive compatible and symptotically ex-ante efficient. The mechanism can be interpreted as a cost per action keyword auction.
Document Type: 
Working Paper

Files in This Item:
218.11 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.