Skip to content
Preprint

A Repeated-Game Framework for Incentives in Decentralized Infrastructure Protocols

Aug 2026 · 0 citations · 22 references
Computer Science

TL;DR

If any profitable deviation does not increase the fail probability relative to compliance, then binary public-outcome protocols cannot deter it, and a protocol design problem is formed mapping service primitives to stake requirements, reward schedules, probation rules, and audit frequency.

Abstract

We introduce a repeated dynamic incentive framework for characterizing when"compliance", or full-effort honest service provision, is incentive compatible in Decentralized Physical Infrastructure Networks (DePIN). We model quality control in this setting as a repeated moral-hazard problem between the protocol and each provider, where compliance is enforced by both slashing posted collateral and the discounted threat of demotion to probation tiers on a reputation ladder. Our main contribution is the"deterrence ratio"$\Gamma$, the worst-case ratio of a deviation's private gain to its marginal probability of detection. We find that if any profitable deviation does not increase the fail probability relative to compliance, then binary public-outcome protocols cannot deter it. When all profitable deviations have positive detection gaps and no weakly costlier action is less likely to fail, compliance is sequentially incentive compatible if and only if immediate slashing plus discounted reputation loss is at least $\Gamma$ at every reputation tier. We use this condition to formulate a protocol design problem mapping service primitives to stake requirements, reward schedules, probation rules, and audit frequency.

View source

Similar papers

Preprint Sep 2026

Beyond Incentive Compatibility: Rational Harm-Proof Transaction Fee Mechanisms

Transaction fee mechanisms (TFMs) allocate scarce block space in blockchains. Prior work focuses on incentive compatibility (IC): honest behavior maximizes the payoff of each strategic player. We introduce rational-harm proofness (RHP), which rules out deviations that harm honest participants without reducing the devia...

Forest Zhang, E. Park, Ke Wu · 0 citations
Preprint Sep 2026

When One Leak Pays Forever: Context Binding and the Price of Deterring Collusion

A coalition that deviates once can profit many times when what it sells keeps working. In a threshold-encrypted mempool, a leading defense against maximal extractable value (MEV), a quorum of the decryption committee that sells its decryption capability to a front-runner exposes every later block that the capability st...

Ting-Yi Lin, Shawn Yu, Ruo-Ran Lai et al. · 0 citations
Preprint Aug 2026

A Statistical Analysis of Three Player Auction Bridge

Three-player Auction Bridge is a finite imperfect-information game in which dynamic partnerships create a distinctive interaction between scoring, strategic incentives, and payoff distribution. This paper develops a unified statistical and game-theoretic framework to evaluate a traditional scoring rule against a modifi...

Aritrabha Majumdar, S. Sarkar, Moutushi Chatterjee · 0 citations
Preprint Sep 2026

Priority Blockers: Welfare and Incentives in Matching under General Constraints

Institutions often face constraints richer than a single capacity. Protecting the priority of a student who cannot be accommodated may then block a lower-priority student who fits. We introduce COP-and-Choose, a cumulative offer process followed by a choice step, and show that its greedy version, which skips such block...

Lars Ehlers, M. Yenmez · 0 citations
#machine learning Preprint Sep 2026

Minimax-Optimal Online Contract Design with Unrestricted Bounded Contracts

We study repeated contract design when a principal observes outcomes but not the actions that generate them. The principal may use any bounded outcome-contingent payment vector, and the agent's best response can make expected profit discontinuous in those payments. For every fixed number $m\ge2$ of outcomes, the minima...

Rui Ai, David Simchi-Levi, Han Zhong · 0 citations
Preprint Oct 2026

Asymptotically Optimal Public Project Redistribution without Bounded Precision: A Complex-Analytic Proof

We study worst-case VCG redistribution mechanism design for the public project problem, where n agents decide whether to build a non-excludable public project and the designer chooses a Groves term that returns as much of the VCG payment as possible without running a deficit. The objective is the worst-case efficiency...

Ming-Yu Guo · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.