Structural Complexity of Rational Interactive Proofs

05/08/2023
by   Daniil Musatov, et al.
0

This is the full version of a paper submitted to the Computability in Europe (CiE 2023) conference, with all proofs omitted there. In 2012 P. D. Azar and S. Micali introduced a new model of interactive proofs, called "Rational Interactive Proofs". In this model the prover is neither honest nor malicious, but rational in terms of maximizing his expected reward. In this article we explore the connection of this area with classic complexity results. In the first part of this article we revise the ties between the counting hierarchy and the hierarchy of constant-round rational proofs. We prove that a polynomial-time machine with oracle access to DRMA[k] decides exactly languages in DRMA[k], a coincidence unknown for levels of the counting hierarchy. In the second part we study communication complexity of single-round rational proofs. We show that the class defined by logarithmic-communication single-round rational proofs coincides with PP. We also show that single-round rational protocols that treat problems in Parity-P as black-box samplers of a random variable require at least a linear number of bits of communication.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2018

Efficient Rational Proofs with Strong Utility-Gap Guarantees

As modern computing moves towards smaller devices and powerful cloud pla...
research
08/01/2017

Rational Proofs with Non-Cooperative Provers

Interactive-proof-based approaches are widely used in verifiable computa...
research
12/28/2018

The Power of Distributed Verifiers in Interactive Proofs

We explore the power of interactive proofs with a distributed verifier. ...
research
05/28/2018

Quantum generalizations of the polynomial hierarchy with applications to QMA(2)

The polynomial-time hierarchy (PH) has proven to be a powerful tool for ...
research
10/02/2019

Doubly-Efficient Pseudo-Deterministic Proofs

In [20] Goldwasser, Grossman and Holden introduced pseudo-deterministic ...
research
07/18/2016

Evaluation of binomial double sums involving absolute values

We show that double sums of the form ∑_i,j=-n ^n |i^sj^t(i^k-j^k)^β| 2n...

Please sign up or login with your details

Forgot password? Click here to reset