Abstract: An emerging frontier in Algorithmic Game Theory is Algorithmic Contract Theory, which studies the classic hidden-action principal-agent problem of contract theory through the computational lens.
In this talk, I will present three basic ways in which the problem can be combinatorial and survey both hardness and poly-time (approximation) results.
The analysis will uncover some surprising connections (but also fundamental differences) to combinatorial auctions.