Incentive-Compatible Recovery from Manipulated Signals, with Applications to Decentralized Physical Infrastructure
Not on the map. Why?
Abstract (arXiv)
We introduce the first formal model capturing the elicitation of unverifiable information from a party (the "source") with implicit signals derived by other players (the "observers"). Our model is motivated in part by applications in decentralized physical infrastructure networks (a.k.a. "DePIN"), an emerging application domain in which physical services (e.g., sensor information, bandwidth, or energy) are provided at least in part by untrusted and self-interested parties. A key challenge in these signal network applications is verifying the level of service that was actually provided by network participants. We first establish a condition called source identifiability, which we show is necessary for the existence of a mechanism for which truthful signal reporting is a strict equilibrium. For a converse, we build on techniques from peer prediction to show that in every signal network that satisfies the source identifiability condition, there is in fact a strictly truthful mechanism, where truthful signal reporting gives strictly higher total expected payoff than any less informative equilibrium. We furthermore show that this truthful equilibrium is in fact the unique equilibrium of the mechanism if there is positive probability that any one observer is unconditionally honest (e.g., if an observer were run by the network owner). Also, by extending our condition to coalitions, we show that there are generally no collusion-resistant mechanisms in the settings that we consider. We apply our framework and results to two DePIN applications: proving location, and proving bandwidth. In the location-proving setting observers learn (potentially enlarged) Euclidean distances to the source. Here, our condition has an appealing geometric interpretation, implying that the source's location can be truthfully elicited if and only if it is guaranteed to lie inside the convex hull of the observers.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 27 references that are in the map. First posted on arXiv 10 Mar 2025.
Builds on
6 of 27 references.
References · 6
- 2013Crowdsourced Judgement Elicitation with Endogenous Proficiencycited by 30
- 2016Informed Truthfulness in Multi-Task Peer Predictioncited by 25
- 2024It Takes Two: A Peer-Prediction Solution for Blockchain Verifier's Dilemmacited by 4
- 2022Proof of Backhaul: Trustfree Measurement of Broadband Bandwidthcited by 1
- 2023Peer Neighborhood Mechanisms: A Framework for Mechanism Generalizationcited by 1
- 2024BFT-PoLoc: A Byzantine Fortified Trigonometric Proof of Location Protocol using Internet Delayscited by 1
Built on by
Not cited yet.