Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability (2402.17108v1)

Published 27 Feb 2024 in cs.GT, cs.DS, and cs.LG

Abstract: We study a repeated contracting setting in which a Principal adaptively chooses amongst $k$ Agents at each of $T$ rounds. The Agents are non-myopic, and so a mechanism for the Principal induces a $T$-round extensive form game amongst the Agents. We give several results aimed at understanding an under-explored aspect of contract theory -- the game induced when choosing an Agent to contract with. First, we show that this game admits a pure-strategy \emph{non-responsive} equilibrium amongst the Agents -- informally an equilibrium in which the Agent's actions depend on the history of realized states of nature, but not on the history of each other's actions, and so avoids the complexities of collusion and threats. Next, we show that if the Principal selects Agents using a \emph{monotone} bandit algorithm, then for any concave contract, in any such equilibrium, the Principal obtains no regret to contracting with the best Agent in hindsight -- not just given their realized actions, but also to the counterfactual world in which they had offered a guaranteed $T$-round contract to the best Agent in hindsight, which would have induced a different sequence of actions. Finally, we show that if the Principal selects Agents using a monotone bandit algorithm which guarantees no swap-regret, then the Principal can additionally offer only limited liability contracts (in which the Agent never needs to pay the Principal) while getting no-regret to the counterfactual world in which she offered a linear contract to the best Agent in hindsight -- despite the fact that linear contracts are not limited liability. We instantiate this theorem by demonstrating the existence of a monotone no swap-regret bandit algorithm, which to our knowledge has not previously appeared in the literature.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)
  1. Characterizing truthful multi-armed bandit mechanisms. In Proceedings of the 10th ACM conference on Electronic commerce, pages 79–88, 2009.
  2. From external to internal regret. Journal of Machine Learning Research, 8(6), 2007.
  3. Contract theory. MIT press, 2004.
  4. Mechanisms for a no-regret agent: Beyond the common prior. In 2020 ieee 61st annual symposium on foundations of computer science (focs), pages 259–270. IEEE, 2020.
  5. Gabriel Carroll. Robustness and linear contracts. American Economic Review, 105(2):536–563, 2015.
  6. Bayesian agency: Linear versus tractable contracts. arXiv e-prints, pages arXiv–2106, 2021.
  7. Sylvain Chassang. Calibrated incentive contracts. Econometrica, 81(5):1935–1971, 2013.
  8. Learning approximately optimal contracts. In International Symposium on Algorithmic Game Theory, pages 331–346. Springer, 2022.
  9. Efficient prior-free mechanisms for no-regret agents. arXiv preprint arXiv:2311.07754, 2023.
  10. From external to swap regret 2.0: An efficient reduction and oblivious adversary for large action spaces, 2023.
  11. Simple versus optimal contracts. In Proceedings of the 2019 ACM Conference on Economics and Computation, EC ’19, page 369–387, New York, NY, USA, 2019. Association for Computing Machinery. ISBN 9781450367929. doi: 10.1145/3328526.3329591. URL https://doi.org/10.1145/3328526.3329591.
  12. Combinatorial contracts. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 815–826. IEEE, 2022.
  13. I. L. Glicksberg. A further generalization of the kakutani fixed point theorem, with applications to nash equilibrium points, 1951.
  14. An analysis of the principal-agent problem. In Foundations of Insurance Economics: Readings in Economics and Finance, pages 302–340. Springer, 1992.
  15. Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems. In Proceedings of the fifteenth ACM conference on Economics and computation, pages 359–376, 2014.
  16. Bengt Holmström. Moral hazard and observability. The Bell journal of economics, pages 74–91, 1979.
  17. Online minimax multiobjective optimization: Multicalibeating and other applications. Advances in Neural Information Processing Systems, 35:29051–29063, 2022.
  18. Fast swap regret minimization and applications to approximate correlated equilibria. arXiv preprint arXiv:2310.19647, 2023.
  19. The sample complexity of online contract design. arXiv preprint arXiv:2211.05732, 2022.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Natalie Collina (14 papers)
  2. Varun Gupta (47 papers)
  3. Aaron Roth (138 papers)
X Twitter Logo Streamline Icon: https://streamlinehq.com