TY - GEN
T1 - An incentive analysis of some bitcoin fee designs
AU - Yao, Andrew Chi chih
N1 - Publisher Copyright:
© Andrew Chi chih Yao; licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020).
PY - 2020/6/1
Y1 - 2020/6/1
N2 - In the Bitcoin system, miners are incentivized to join the system and validate transactions through fees paid by the users. A simple “pay your bid” auction has been employed to determine the transaction fees. Recently, Lavi, Sattath and Zohar [8] proposed an alternative fee design, called the monopolistic price (MP) mechanism, aimed at improving the revenue for the miners. Although MP is not strictly incentive compatible (IC), they studied how close to IC the mechanism is for iid distributions, and conjectured that it is nearly IC asymptotically based on extensive simulations and some analysis. In this paper, we prove that the MP mechanism is nearly incentive compatible for any iid distribution as the number of users grows large. This holds true with respect to other attacks such as splitting bids. We also prove a conjecture in [8] that MP dominates the RSOP auction in revenue (originally defined in Goldberg et al. [5] for digital goods). These results lend support to MP as a Bitcoin fee design candidate. Additionally, we explore some possible intrinsic correlations between incentive compatibility and revenue in general.
AB - In the Bitcoin system, miners are incentivized to join the system and validate transactions through fees paid by the users. A simple “pay your bid” auction has been employed to determine the transaction fees. Recently, Lavi, Sattath and Zohar [8] proposed an alternative fee design, called the monopolistic price (MP) mechanism, aimed at improving the revenue for the miners. Although MP is not strictly incentive compatible (IC), they studied how close to IC the mechanism is for iid distributions, and conjectured that it is nearly IC asymptotically based on extensive simulations and some analysis. In this paper, we prove that the MP mechanism is nearly incentive compatible for any iid distribution as the number of users grows large. This holds true with respect to other attacks such as splitting bids. We also prove a conjecture in [8] that MP dominates the RSOP auction in revenue (originally defined in Goldberg et al. [5] for digital goods). These results lend support to MP as a Bitcoin fee design candidate. Additionally, we explore some possible intrinsic correlations between incentive compatibility and revenue in general.
KW - Bitcoin
KW - Blockchain
KW - Incentive compatibility
KW - Maximum revenue
KW - Mechanism design
UR - https://www.scopus.com/pages/publications/85089352646
U2 - 10.4230/LIPIcs.ICALP.2020.1
DO - 10.4230/LIPIcs.ICALP.2020.1
M3 - 会议稿件
AN - SCOPUS:85089352646
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
A2 - Czumaj, Artur
A2 - Dawar, Anuj
A2 - Merelli, Emanuela
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020
Y2 - 8 July 2020 through 11 July 2020
ER -