Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Contracts with Inspections (2402.16553v1)

Published 26 Feb 2024 in cs.GT

Abstract: In the classical principal-agent hidden-action model, a principal delegates the execution of a costly task to an agent for which he can choose among actions with different costs and different success probabilities to accomplish the task. To incentivize the agent to exert effort, the principal can commit to a contract, which is the amount of payment based on the task's success. A crucial assumption of this model is that the principal can only base the payment on the outcome but not on the agent's chosen action. In this work, we relax the hidden-action assumption and introduce a new model where the principal is allowed to inspect subsets of actions at some cost that depends on the inspected subset. If the principal discovers that the agent did not select the agreed-upon action through the inspection, the principal can withhold payment. This relaxation of the model introduces a broader strategy space for the principal, who now faces a tradeoff between positive incentives (increasing payment) and negative incentives (increasing inspection). We show how to find the best deterministic incentive-compatible inspection scheme for all monotone inspection cost functions. We then turn to randomized inspection schemes and show that one can efficiently find the best randomized incentive-compatible inspection scheme when the inspection cost function is submodular. We complement this result by showing that it is impossible to efficiently find the optimal randomized inspection scheme for the more general case of XOS inspection cost functions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. Contracts with private cost per unit-of-effort. In EC, pages 52–69. ACM, 2021a.
  2. Incomplete information VCG contracts for common agency. In EC, page 70. ACM, 2021b.
  3. Bayesian analysis of linear contracts. In EC, page 66. ACM, 2023.
  4. Improved truthful mechanisms for subadditive combinatorial auctions: Breaking the logarithmic barrier. In SODA, pages 653–661. SIAM, 2021.
  5. Combinatorial agency. J. Econ. Theory, 147(3):999–1034, 2012.
  6. I. Ball and J. Knoepfle. Should the timing of inspections be predictable? In EC, page 206. ACM, 2023.
  7. G. Carroll. Robustness and linear contracts. American Economic Review, 105(2):536–63, 2015.
  8. Bayesian agency: Linear versus tractable contracts. Artif. Intell., 307:103684, 2022a.
  9. Designing menus of contracts efficiently: The power of randomization. In EC, pages 705–735. ACM, 2022b.
  10. Multi-agent contract design: How to commission multiple agents with individual outcomes. In EC, pages 412–448. ACM, 2023.
  11. J. R. Correa and A. Cristi. A constant factor prophet inequality for online combinatorial auctions. In STOC, pages 686–697. ACM, 2023.
  12. T. Dai and J. Toikka. Robust incentives for teams. Econometrica, 90(4):1583–1613, 2022.
  13. On supermodular contracts and dense subgraphs. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 109–132. SIAM, 2024.
  14. Approximation algorithms for combinatorial auctions with complement-free bidders. In STOC, pages 610–618. ACM, 2005.
  15. Simple versus optimal contracts. In EC, pages 369–387. ACM, 2019.
  16. Combinatorial contracts. In FOCS, pages 815–826. IEEE, 2021a.
  17. The complexity of contracts. SIAM J. Comput., 50(1):211–254, 2021b.
  18. Multi-agent contracts. In STOC, pages 1311–1324. ACM, 2023.
  19. Combinatorial contracts beyond gross substitutes. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 92–108. SIAM, 2024.
  20. Y. Emek and M. Feldman. Computing optimal contracts in combinatorial agencies. Theor. Comput. Sci., 452:56–74, 2012.
  21. On the (In)approximability of Combinatorial Contracts. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), volume 287, pages 44:1–44:22. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.
  22. A. Fallah and M. I. Jordan. Contract design with safety inspections. CoRR, abs/2311.02537, 2023.
  23. Combinatorial auctions via posted prices. In SODA, pages 123–135. SIAM, 2015.
  24. D. Gottlieb and H. Moreira. Simple contracts with adverse selection and moral hazard. Theoretical Economics, 17(3):1357–1401, 2022.
  25. An analysis of the principal-agent problem. Econometrica, 51(1):7–45, 1983.
  26. Contracts under moral hazard and adverse selection. In EC, pages 563–582. ACM, 2021.
  27. Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems. J. Artif. Intell. Res., 55:317–359, 2016.
  28. B. Holmstrom and P. Milgrom. Aggregation and linearity in the provision of intertemporal incentives. Econometrica, 55(2):303–328, 1987.
  29. B. Holmstrom and P. Milgrom. Multitask principal-agent analyses: Incentive contracts, asset ownership, and job design. Journal of Law, Economics, and Organization, 7:24–52, 1991.
  30. A. Kambhampati. Randomization is optimal in the robust principal-agent problem. Journal of Economic Theory, 207(C), 2023.
  31. Job matching, coalition formation, and gross substitutes. Econometrica, 50(6):1483–1504, 1982.
  32. R. Lavi and E. S. Shamash. Principal-agent VCG contracts. J. Econ. Theory, 201:105443, 2022.
  33. Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav., 55(2):270–296, 2006.
  34. D. Walton and G. Carroll. A general framework for robust contracting models. Econometrica, 90(5):2129–2159, 2022.
  35. Y. Yu and X. Kong. Robust contract designs: Linear contracts and moral hazard. Oper. Res., 68(5):1457–1473, 2020.
  36. The sample complexity of online contract design. In EC, page 1188. ACM, 2023.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Tomer Ezra (31 papers)
  2. Stefano Leonardi (47 papers)
  3. Matteo Russo (11 papers)
Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com