Partial Verification as a Substitute for Money
Computer Science and Game Theory
2019-01-24 v2
Abstract
Recent work shows that we can use partial verification instead of money to implement truthful mechanisms. In this paper we develop tools to answer the following question. Given an allocation rule that can be made truthful with payments, what is the minimal verification needed to make it truthful without them? Our techniques leverage the geometric relationship between the type space and the set of possible allocations.
Cite
@article{arxiv.1812.07312,
title = {Partial Verification as a Substitute for Money},
author = {Sofia Ceppi and Ian Kash and Rafael Frongillo},
journal= {arXiv preprint arXiv:1812.07312},
year = {2019}
}
Comments
Extended Version of 'Partial Verification as a Substitute for Money', AAAI 2019