arXiv AI By Mikael M{\o}ller H{\o}gsgaard

The Optimal Sample Complexity of Linear Contracts

Read the original on arXiv AI →

arXiv:2601. 01496v3 Announce Type: replace-cross Abstract: In this paper, we settle the problem of learning optimal linear contracts from data in the offline setting, where agent types are drawn from an unknown distribution and the principal's goal is to design a contract that maximizes her expected utility.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.