← volver

Seminario Anillo Information and Computation in Market Design

15:00 horas, Sala de Seminario von Neuman, Centro de Modelamiento Matemático (CMM), Beauchef 851 (Torre Norte).

Invitado: Paul Duetting, Google Research.

Título: “Combinatorial Contracts”.

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.