2018/12/18 by Sofia Ceppi, Ceppi, Sofia, Ian Kash +3
Computer Science · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #cs.GT
paper · pdf · doi:10.48550/arxiv.1812.07312
Extended Version of 'Partial Verification as a Substitute for Money', AAAI 2019
arxiv created 2019/01/23 · arxiv updated 2019/01/24
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.