TL;DR
This paper introduces a new relational refinement type system, HOARe^2, for verifying incentive properties and differential privacy in mechanism design, enabling formal verification of complex probabilistic properties.
Contribution
The paper presents HOARe^2, a sound type system that models relational properties in probabilistic computations, including differential privacy, and demonstrates its effectiveness on complex mechanism design examples.
Findings
HOARe^2 correctly models (ε,δ)-differential privacy.
It subsumes existing systems like DFuzz.
Successfully verifies mechanisms like auctions and aggregative games.
Abstract
Mechanism design is the study of algorithm design in which the inputs to the algorithm are controlled by strategic agents, who must be incentivized to faithfully report them. Unlike typical programmatic properties, it is not sufficient for algorithms to merely satisfy the property---incentive properties are only useful if the strategic agents also believe this fact. Verification is an attractive way to convince agents that the incentive properties actually hold, but mechanism design poses several unique challenges: interesting properties can be sophisticated relational properties of probabilistic computations involving expected values, and mechanisms may rely on other probabilistic properties, like differential privacy, to achieve their goals. We introduce a relational refinement type system, called , for verifying mechanism design and differential privacy. We show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
