Hiring for An Uncertain Task: Joint Design of Information and Contracts

TL;DR

This work initiates the computational theory of jointly designing information and contracts, introducing Ambiguous Contracts, Menus of Explicit Contracts, and a Single Explicit Contract as progressively simpler forms. It reveals a sharp trade-off: Ambiguous contracts admit a polynomial-time approximation method, while explicit menus and single contracts are APX-hard, with linear-contract special cases becoming tractable via an FPTAS. The study also shows that direct mechanisms are optimal in some regimes but not in the menu-based setting, and identifies fundamental limits of the revelation principle in this joint design context. Overall, the paper provides a taxonomy of tractability for information-contract design and offers practical approximation schemes for linear-contract variants. These results advance understanding of information-use under moral hazard and offer computationally feasible tools for practical deployment in information-rich environments.

Abstract

In this paper, we initiate the computational problem of jointly designing information and contracts. We consider three possible classes of contracts with decreasing flexibility and increasing simplicity: ambiguous contracts, menus of explicit contracts and explicit single contract. Ambiguous contracts allow the principal to conceal the applied payment schemes through a contract that depends on the unknown state of nature, while explicit contracts reveal the contract prior to the agent's decision. Our results show a trade-off between the simplicity of the contracts and the computational complexity of the joint design. Indeed, we show that an approximately-optimal mechanism with ambiguous contracts can be computed in polynomial time. However, they are convoluted mechanisms and not well-suited for some real-world scenarios. Conversely, explicit menus of contracts and single contracts are simpler mechanisms, but they cannot be computed efficiently. In particular, we show that computing the optimal mechanism with explicit menus of contracts and single contracts is APX-Hard. We also characterize the structure of optimal mechanisms. Interestingly, direct mechanisms are optimal for both the most flexible ambiguous contracts and the least flexible explicit single contract, but they are suboptimal for that with menus of contracts. Finally, motivated by our hardness results, we turn our attention to menus of linear contracts and single linear contracts. We show that both the problem of computing the optimal mechanism with an explicit menu of linear contracts and an explicit single linear contract admits an FPTAS.

Figures (3)

• Figure 1: An example for the reduction of Theorem , where the graph consists of $3$ nodes A, B, C such that A is connected to B and C and B and C are not connected. All the empty entries are zeros.
• Figure 2: An example for the reduction of Theorem , where the empty entries are all zeros.
• Figure 3: The construction of three probability matrices in the constructed instance of Theorem \ref{['theoremsupereconmanntoacdhi']}, where the blank entries is $0$.

Theorems & Definitions (30)

• Remark 2.1
• Definition 2.1
• Definition 2.2
• Lemma 3.1
• Proposition 3.2
• Theorem 3.3
• Lemma 3.4
• Lemma 3.5
• Proposition 4.1
• Theorem 4.2