Learning approximately optimal contracts

DOI10.1016/j.tcs.2023.114219MaRDI QIDQ6069846

Argyrios Deligkas, Alon Cohen, Moran Koren

Publication date: 17 November 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

game theorylearningcontractsbandits

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial agency
• Bayesian agency: linear versus tractable contracts
• Lipschitz Bandits without the Lipschitz Constant
• Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
• A Continuous-Time Version of the Principal–Agent Problem
• Mixed Strategies in Combinatorial Agency
• An Analysis of the Principal-Agent Problem
• Dynamic Contracts with Moral Hazard and Adverse Selection
• The Continuum-Armed Bandit Problem
• Risk Aversion in the Small and in the Large
• Improved Rates for the Stochastic Continuum-Armed Bandit Problem
• The Complexity of Contracts
• Designing menus of contracts efficiently: the power of randomization

This page was built for publication: Learning approximately optimal contracts