mlsanityData to 7 Oct 2026

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability

arXiv 2402.17108 ↗First posted 27 Feb 2024cs.GT cs.DS cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

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 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 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.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 10 of its 24 references that are in the map. First posted on arXiv 27 Feb 2024.

Builds on

10 of 24 references.

References · 10

  1. 2014Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problemscited by 46
  2. 2018Simple versus Optimal Contractscited by 33
  3. 2023Fast swap regret minimization and applications to approximate correlated equilibriacited by 30
  4. 2021Online Minimax Multiobjective Optimization: Multicalibeating and Other Applicationscited by 26
  5. 2020Mechanisms for a No-Regret Agent: Beyond the Common Priorcited by 18
  6. 2017Multi-armed Bandit Problems with Strategic Armscited by 16
  7. 2018Learning Approximately Optimal Contractscited by 12
  8. 2021Bayesian Agency: Linear versus Tractable Contractscited by 12
  9. 2021Combinatorial Contractscited by 12
  10. 2023Efficient Prior-Free Mechanisms for No-Regret Agentscited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.