The Complexity of Contracts

DOI10.1137/1.9781611975994.164OpenAlexW4213443036MaRDI QIDQ5146960

Tim Roughgarden, Paul Dütting, Inbal Talgam-Cohen

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.164

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Bayesian agency: linear versus tractable contracts ⋮ Designing menus of contracts efficiently: the power of randomization

This page was built for publication: The Complexity of Contracts