Pith. sign in

REVIEW 1 cited by

Bayesian Mechanism Design for Blockchain Transaction Fee Allocation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2209.13099 v7 pith:WKLNDVNJ submitted 2022-09-27 cs.GT

classification cs.GT
keywords mechanismbniccollusion-proofdesigndsicmechanismsminerrevenue
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In blockchain systems, the design of transaction fee mechanisms is essential for stability and satisfaction for both miners and users. A recent work has proven the impossibility of collusion-proof mechanisms that achieve both non-zero miner revenue and Dominating-Strategy-Incentive-Compatible (DSIC) for users. However, a positive miner revenue is important in practice to motivate miners. To address this challenge, we consider a Bayesian game setting and relax the DSIC requirement for users to Bayesian-Nash-Incentive-Compatibility (BNIC). In particular, we propose an auxiliary mechanism method that makes connections between BNIC and DSIC mechanisms. With the auxiliary mechanism method, we design a transaction fee mechanism (TFM) based on the multinomial logit (MNL) choice model, and prove that the TFM has both BNIC and collusion-proof properties with an asymptotic constant-factor approximation of optimal miner revenue for i.i.d. bounded valuations. Our result breaks the zero-revenue barrier while preserving truthfulness and collusion-proof properties.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Transaction Fee Mechanism Design for Leaderless Blockchain Protocols

    cs.GT 2025-05 conditional novelty 8.0 of 10

    The paper introduces a game-theoretic model and the FPA-EQ fee mechanism for multi-proposer blockchains, with a tight 63.2% welfare guarantee and matching impossibility results.

Pith tools