  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.
