Credible, Optimal Auctions via Blockchains

01/29/2023
by   Tarun Chitra, et al.
0

Akbarpour and Li (2020) formalized credibility as an auction desideratum where the auctioneer cannot benefit by implementing undetectable deviations from the promised auction and showed that, in the plain model, the ascending price auction with reserves is the only credible, strategyproof, revenue-optimal auction. Ferreira and Weinberg (2020) proposed the Deferred Revelation Auction (DRA) as a communication efficient auction that avoids the uniqueness results from Akbarpour and Li (2020) assuming the existence of cryptographic commitments and as long as bidder valuations are MHR. They also showed DRA is not credible in settings where bidder valuations are α-strongly regular unless α > 1. In this paper, we ask if blockchains allow us to design a larger class of credible auctions. We answer this question positively, by showing that DRA is credible even for α-strongly regular distributions for all α > 0 if implemented over a secure and censorship-resistant blockchain. We argue ledgers provide two properties that limit deviations from a self-interested auctioneer. First, the existence of smart contracts allows one to extend the concept of credibility to settings where the auctioneer does not have a reputation – one of the main limitations for the definition of credibility from Akbarpour and Li (2020). Second, blockchains allow us to implement mechanisms over a public broadcast channel, removing the adaptive undetectable deviations driving the negative results of Ferreira and Weinberg (2020).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2022

Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for all Distributions

We consider a revenue-maximizing seller with a single item for sale to m...
research
01/23/2019

AStERISK: Auction-based Shared Economy ResolutIon System for blocKchain

Recent developments in blockchains and edge computing allows to deploy d...
research
04/03/2020

Credible, Truthful, and Two-Round (Optimal) Auctions via Cryptographic Commitments

We consider the sale of a single item to multiple buyers by a revenue-ma...
research
04/03/2020

Credible, Truthful, and Bounded-Round Mechanisms via Cryptographic Commitments

We consider the sale of a single item to multiple buyers by a revenue-ma...
research
05/19/2021

Calibrated Click-Through Auctions: An Information Design Approach

We analyze the optimal information design in a click-through auction wit...
research
01/30/2023

Censorship Resistance in On-Chain Auctions

Smart contracts offer a way to credibly commit to a mechanism, as long a...
research
02/21/2021

Dynamical Analysis of the EIP-1559 Ethereum Fee Market

Participation in permissionless blockchains results in competition over ...

Please sign up or login with your details

Forgot password? Click here to reset