A Model for Donation Verification

TL;DR

This paper presents a probabilistic model for verifying donations, proposing an algorithm to approximate total contributions and discussing limitations where verification is impossible.

Contribution

Introduces a novel randomized algorithm for donation verification and explores fundamental limitations of the verification process.

Findings

Algorithm achieves (1-ε)-approximation of total donations.

Certain scenarios make donation verification fundamentally impossible.

Provides theoretical bounds on verification feasibility.

Abstract

In this paper, we introduce a model for donation verification. A randomized algorithm is developed to check if the money claimed being received by the collector is $(1-\epsilon)$-approximation to the total amount money contributed by the donors. We also derive some negative results that show it is impossible to verify the donations under some circumstances.