Computer-aided verification in mechanism design
release_kxwjpbgfjfdclgjymlyyqazswm
by
Gilles Barthe, Marco Gaboardi, Emilio Jesús Gallego Arias, Justin
Hsu, Aaron Roth, Pierre-Yves Strub
2015
Abstract
In mechanism design, the gold standard solution concepts are dominant
strategy incentive compatibility and Bayesian incentive compatibility. These
solution concepts relieve the (possibly unsophisticated) bidders from the need
to engage in complicated strategizing. While incentive properties are simple to
state, their proofs are specific to the mechanism and can be quite complex.
This raises two concerns. From a practical perspective, checking a complex
proof can be a tedious process, often requiring experts knowledgeable in
mechanism design. Furthermore, from a modeling perspective, if unsophisticated
agents are unconvinced of incentive properties, they may strategize in
unpredictable ways.
To address both concerns, we explore techniques from computer-aided
verification to construct formal proofs of incentive properties. Because formal
proofs can be automatically checked, agents do not need to manually check the
properties, or even understand the proof. To demonstrate, we present the
verification of a sophisticated mechanism: the generic reduction from Bayesian
incentive compatible mechanism design to algorithm design given by Hartline,
Kleinberg, and Malekian. This mechanism presents new challenges for formal
verification, including essential use of randomness from both the execution of
the mechanism and from the prior type distributions. As an immediate
consequence, our work also formalizes Bayesian incentive compatibility for the
entire family of mechanisms derived via this reduction. Finally, as an
intermediate step in our formalization, we provide the first formal
verification of incentive compatibility for the celebrated
Vickrey-Clarke-Groves mechanism.
In text/plain
format
Archived Files and Locations
application/pdf 577.2 kB
file_wcok2vuekjf7jdcnglrqqs7zoq
|
arxiv.org (repository) web.archive.org (webarchive) |
1502.04052v2
access all versions, variants, and formats of this works (eg, pre-prints)