Transaction Fee Mechanisms (TFMs) study auction design in the Blockchain context, and emphasize robustness against miner and user collusion, moreso than traditional auction theory. \cite{chung2023foundations} introduce the notion of a mechanism being $c$-Side-Contract-Proof ($c$-SCP), i.e., robust to a collusion of the miner and $c$ users. Later work \cite{chung2024collusion,welfareIncreasingCollusion} shows a gap between the $1$-SCP and $2$-SCP classes. We show that the class of $2$-SCP mechanisms equals that of any $c$-SCP with $c\geq 2$, under a relatively minor assumption of consistent tie-breaking. In essence, this implies that any mechanism vulnerable to collusion, is also vulnerable to a small collusion.
翻译:交易费机制(TFMs)研究区块链环境下的拍卖设计,相较于传统拍卖理论更强调对矿工与用户合谋的鲁棒性。\cite{chung2023foundations} 提出了机制具有 $c$ 侧合约证明性($c$-SCP)的概念,即能够抵抗矿工与 $c$ 个用户合谋的稳健性。后续研究 \cite{chung2024collusion,welfareIncreasingCollusion} 揭示了 $1$-SCP 与 $2$-SCP 两类机制之间存在性能差异。本文证明,在相对次要的一致性平局处理假设下,$2$-SCP 机制类等同于任何 $c \geq 2$ 的 $c$-SCP 机制类。本质上,这意味着任何易受合谋攻击的机制,同样也易受小型合谋的攻击。