Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising
Hamid Nazerzadeh (),
Amin Saberi () and
Rakesh Vohra ()
Additional contact information
Hamid Nazerzadeh: Marshall School of Business, University of Southern California, Los Angeles, California 94305
Amin Saberi: Management Science and Engineering Department, Stanford University, Stanford, California 94305
Rakesh Vohra: Kellogg School of Management, Northwestern University, Evanston, Illinois 60208
Operations Research, 2013, vol. 61, issue 1, 98-111
Abstract:
We examine the problem of allocating an item repeatedly over time amongst a set of agents. The value that each agent derives from consumption of the item may vary over time. Furthermore, it is private information to the agent, and prior to consumption it may be unknown to that agent. We describe a mechanism based on a sampling-based learning algorithm that under suitable assumptions is asymptotically individually rational, asymptotically Bayesian incentive compatible, and asymptotically ex ante efficient. Our mechanism can be interpreted as a pay-per-action or pay-per-acquisition (PPA) charging scheme in online advertising. In this scheme, instead of paying per click, advertisers pay only when a user takes a specific action (e.g., purchases an item or fills out a form) on their websites.
Keywords: dynamic mechanism design; prior-free mechanisms; online advertising; sponsored search; pay-per-action; cost-per-action; click fraud (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.1120.1124 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:61:y:2013:i:1:p:98-111
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().