Abstract
AbstractTwo keyword auction mechanisms, the Generalized Second‐Price auction (GSP) and the Vickrey‐Clarke‐Groves mechanism (VCG), were compared theoretically and experimentally. The former is widely used in practice; the latter is not, but it has a dominant strategy equilibrium where all participants bid their true values. In the theoretical investigation, by applying the “locally envy‐free Nash equilibrium” to the VCG, we found that the allocations are efficient and that upper and lower bounds of the auctioneer's revenue coincide in the two mechanisms. A laboratory experiment, in which the revenues and efficiencies were similar in both mechanisms, supported this result.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
