Efficient rational proofs with strong utility-gap guarantees

DOI10.1007/978-3-319-99660-8_14zbMath1400.68069arXiv1807.01389OpenAlexW2809732158MaRDI QIDQ1617659

Jing Chen, Samuel McCauley, Shikha Singh

Publication date: 8 November 2018

Full work available at URL: https://arxiv.org/abs/1807.01389

Mathematics Subject Classification ID

Applications of game theory (91A80) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (4)

Structural complexity of rational interactive proofs ⋮ Verifiable crowd computing: coping with bounded rationality ⋮ Unnamed Item ⋮ Sumcheck-based delegation of quantum computing to rational server

This page was built for publication: Efficient rational proofs with strong utility-gap guarantees