Optimal contract design via relaxation: application to the problem of brokerage fee for a client with private signal
In this paper we show how the relaxation techniques can be used to establish the existence of an optimal contract in presence of information asymmetry. The method we illustrate was initially motivated by the problem of designing optimal brokerage fees, but it does apply to other optimal contract problems, in which (i) the agent controls linearly the drift of a diffusion process, (ii) the direct dependence of the principal's and the agent's objectives on the strategy of the agent is of a special form, and (iii) the space of admissible contracts is compact. This method is then applied to establish existence of an optimal brokerage fee in a market model with a private trading signal observed by the broker's client but not by the broker.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Contracting Dynamical System Perspective toward Interval Markov Decision Processes
Interval Markov decision processes are a class of Markov models where the transition probabilities between the states belong to intervals. In this paper, we study the problem of efficient estimation of the optimal polici…
Fast globally optimal Truncated Least Squares point cloud registration with fixed rotation axis
Recent results showed that point cloud registration with given correspondences can be made robust to outlier rates of up to 95\% using the truncated least squares (TLS) formulation. However, solving this combinatorial op…
Point Cloud RegistrationPoint CloudsHarnessing the Continuous Structure: Utilizing the First-order Approach in Online Contract Design
This work studies the online contract design problem. The principal's goal is to learn the optimal contract that maximizes her utility through repeated interactions, without prior knowledge of the agent's type (i.e., the…
Generalized Second Order Value Iteration in Markov Decision Processes
Value iteration is a fixed point iteration technique utilized to obtain the optimal value function and policy in a discounted reward Markov Decision Process (MDP). Here, a contraction operator is constructed and applied …
Reinforcement LearningHilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
Motivated by the entropic optimal transport problem in unbounded settings, we study versions of Hilbert's projective metric for spaces of integrable functions of bounded growth. These versions of Hilbert's metric origina…