Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2304.03341

The value of the information in the Moral Hazard setting

Ishak Hajjej·Caroline Hillairet·Mohamed Mnif
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article studies the problem of evaluating the information that a Principal lacks when establishing an incentive contract with an Agent whose effort is not observable. The Principal ("she") pays a continuous rent to the Agent ("he"), while the latter gives a best response characterized by his effort, until a terminal date decided by the Principal when she stops the contract and gives compensation to the Agent. The output process of the project is a diffusion process driven by a Brownian motion whose drift is impacted by the Agent's effort. The first part of the paper investigates the optimal stochastic control problem when the Principal and the Agent share the same information. This situation, known as the first-best case, is solved by tackling the Lagrangian problem. In the second part, the Principal observes the output process but she may not observe the drift and the Brownian motion separately. This situation is known as the second-best case. We derive the best response of the Agent, then we solve the mixed optimal stopping/stochastic control problem of the Principal under a fixed probability and on the filtration generated by the Brownian motion, which is larger than the one generated by the output process (that corresponds to the information available for the Principal). Under some regularity conditions, the Principal value function is characterized by solving the associated Hamilton Jacobi Bellman Variational Inequality. At the optimum, we prove that the two filtrations coincide. Finally, we compute the value of the information for the Principal provided by the observation of the Agent's effort. It is defined as the difference between the principal value function in the first-best and second-best cases.

Explore related subjects

math.OCmath.PR

Keep this discovery

BibTeXRIS

Ishak Hajjej, Caroline Hillairet, Mohamed Mnif. 2023-04-06. The value of the information in the Moral Hazard setting. https://arxiv.org/abs/2304.03341

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC↗
arXiv2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC↗
arXiv2026

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC↗