Journal article · 2026 · Open access

Multi-Agent Contracts

Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Keßelheim

Journal of the ACM, 73(2), 1–37 · Published 11 March 2026 · DOI 10.1145/3801154

Open full textCite this paper

In brief

“Multi-Agent Contracts” is a 2026 journal article by Paul Dütting and 3 co-authors, published in Journal of the ACM. OpenAlex counts 4 citations as of 18 November 2026, which puts it in the top 3% of works published in 2026 by citations. It is open access under a CC BY licence: the full text is free to read at Journal of the ACM.

Citations
4
Most cited in
2026 (4)
Field-weighted impact
9.67
References
49
Authors
4

Abstract

We study a natural combinatorial single-principal multi-agent contract design problem, in which a principal motivates a team of agents to exert effort toward a given task. At the heart of our model is a reward function , which maps the agent efforts to an expected reward of the principal. We seek to design computationally efficient algorithms for finding optimal (or near-optimal) linear contracts for reward functions that belong to the complement-free hierarchy. Our first main result gives constant-factor approximation algorithms for submodular and XOS reward functions, with value oracles for submodular reward functions and value and demand oracles for XOS reward functions. It relies on an unconventional use of “prices” and (approximate) demand queries for selecting the set of agents that the principal should contract with, and exploits a novel scaling property of XOS functions and their marginals, which may be of independent interest. As our second main result, we show that constant approximation is the best we can get for submodular reward functions, even with both value and demand oracles. For the larger class of subadditive reward functions, we establish an \(\Omega (\sqrt {n})\) impossibility for settings with n agents. A striking feature of this impossibility is that it applies to subadditive functions that are constant-factor close to submodular. This rapid degradation presents a surprising departure from previous literature, e.g., on combinatorial auctions, where approximation guarantees tend to deteriorate more gracefully.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Dütting, P., Ezra, T., Feldman, M., & Keßelheim, T. (2026). Multi-Agent Contracts. Journal of the ACM, 73(2), 1–37. https://doi.org/10.1145/3801154

MLA 9

Dütting, Paul, et al. “Multi-Agent Contracts.” Journal of the ACM, vol. 73, no. 2, 2026, pp. 1–37. https://doi.org/10.1145/3801154.

Chicago

Dütting, Paul, Tomer Ezra, Michal Feldman, and Thomas Keßelheim. 2026. “Multi-Agent Contracts.” Journal of the ACM 73 (2): 1–37. https://doi.org/10.1145/3801154.

Harvard

Dütting, P. et al. (2026) ‘Multi-Agent Contracts’, Journal of the ACM, 73(2), pp. 1–37. doi:10.1145/3801154.

IEEE

P. Dütting, T. Ezra, M. Feldman, and T. Keßelheim, “Multi-Agent Contracts,” Journal of the ACM, vol. 73, no. 2, pp. 1–37, 2026, doi: 10.1145/3801154.

BibTeX

@article{dutting2026multi,
  title     = {{Multi-Agent Contracts}},
  author    = {Dütting, Paul and Ezra, Tomer and Feldman, Michal and Keßelheim, Thomas},
  journal   = {Journal of the ACM},
  year      = {2026},
  volume    = {73},
  number    = {2},
  pages     = {1--37},
  doi       = {10.1145/3801154},
  url       = {https://doi.org/10.1145/3801154}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Auction Theory and Applications

  • principal-agent problem
  • linear contracts
  • submodular functions
  • subadditive functions
  • approximation algorithms
  • hardness of approximation
  • combinatorial optimization

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Dütting, P., Ezra, T., Feldman, M., & Keßelheim, T. (2026). Multi-Agent Contracts. Journal of the ACM, 73(2), 1–37. https://doi.org/10.1145/3801154

How many times has this paper been cited?

4 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Journal of the ACM: sign in and open the full text from this page.

Who wrote this paper?

Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Keßelheim.

What is the DOI of this paper?

10.1145/3801154, permanently at https://doi.org/10.1145/3801154. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.