Optimal allocations with capacity constrained verification

Autor: Erlanson, Albin, Kleiner, Andreas
Rok vydání: 2024
Předmět:
Druh dokumentu: Working Paper
Popis: A principal has $m$ identical objects to allocate among a group of $n$ agents. Objects are desirable and the principal's value of assigning an object to an agent is the agent's private information. The principal can verify up to $k$ agents, where $k
Databáze: arXiv