Information asymmetry is a central problem in both computer science and economics. In many fundamental problems, an uninformed principal wants to obtain some knowledge from an untrusted expert. This models several real-world situations, such as a manager's relation with her employees, or the delegation of computational tasks in mechanical turk. Because the expert is untrusted, the principal needs some guarantee that the provided knowledge is correct. In computer science, this guarantee is usually provided via a proof, which the principal can verify. Thus, a dishonest expert will get caught and penalized (with very high probability). In many economic settings, the guarantee that the knowledge is correct is usually provided via incentives. That is, a game is played between expert and principal such that the expert maximizes her utility by being honest. A rational proof is an interactive proof where the prover, Merlin, is neither honest nor malicious, but rational. That is, Merlin acts in order to maximize his own utility. Rational proofs have been previously studied when the verifier, Arthur, is a probabilistic polynomial-time machine [1]. In this paper, we study super efficient rational proofs, that is, rational proofs where Arthur runs in logarithmic time. Our new rational proofs are very practical. Not only are they much faster than their classical analogues, but they also provide very tangible incentives for the expert to be honest. Arthur only needs a polynomial-size budget, yet he can penalize Merlin by a large quantity if he deviates from the truth. We give the following characterizations of which problems admit super-efficient rational proofs. (1) Uniform T C 0 coincides with the set of languages L that admit a rational proof using O(log n) time, O(log n) communication, a constant number of rounds and a polynomial size budget. (2) P ||N P coincides with the set of languages having a rational proof using O(log n) time, poly(n) communication, one round and a polynomial-size budget. Furthermore, we show that when Arthur is restricted to have a polynomial-size budget, the set of languages which admit rational proofs with polynomial time verification, polynomial communication and one round is P ||M A
In a follow-up work REF , the authors design super-efficient rational proofs that have sublinear verification and computation compelexity.
Super-efficient rational proofs
EC '13
Computer Science