Using lotteries in auctions when buyers collude - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2005

Using lotteries in auctions when buyers collude

(1)
1

Résumé

This paper studies the optimal auction for a seller who is bound to sell a single item to one of two potential buyers organized in a "well-coordinated" cartel. After discussing the way the cartel reacts to any auction mechanism, we show that if the seller has no way to deter collusion, he can still accomodate it optimally with a very simple mechanism, either having the cartel pay to get an efficient allocation or randomly allocating the item. We then discuss the way to implement this mechanism, so that it enables a fair amount of competition if the seller made a mistake and the buyers don't collude. We find that a simple implementation using reserve prices and lotteries may yield expected revenues close to the optimum if buyers compete, while highly increasing expected revenues if they collude. Finally, we discuss the extension to the n-buyers case.
Fichier principal
Vignette du fichier
232.pdf (283.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01021534 , version 1 (17-07-2014)

Identifiants

  • HAL Id : hal-01021534 , version 1

Citer

Nicolas Gruyer. Using lotteries in auctions when buyers collude. 2005. ⟨hal-01021534⟩

Collections

ENAC LARA
87 Consultations
81 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More