The mathematics of principal-agent problems
Bibo Liu
Abstract
Bibo Liu
Abstract
The principal-agent problem is an important model in the field of Economics of Information. In this thesis we study only a particular type of principal-agent problem which is called moral hazard model and by the principal-agent problem we mean it is moral hazard model. The moral hazard model actually belongs to the class of bilevel programming problems in Mathematics. In Economics. the first order approach is used to reduce the principal-agent problem to a single level optimization problem. However, this approach is only valid under some strong conditions. Moreover the approach can only be used under the assumption that the optimal action of the principal-agent problem and its relaxed problem appears only at an interior point. In this thesis, we consider a new relaxed problem. Under more general assumptions. we can solve the principal-agent problem without restricting the optimal action of the agent to be in the interior.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The principal-agent problem is an important model in the field of Economics of Information. In this thesis we study only a particular type of principal-agent problem which is called moral hazard model and by the principal-agent problem we mean it is moral hazard model. The moral hazard model actually belongs to the class of bilevel programming problems in Mathematics. In Economics. the first order approach is used to reduce the principal-agent problem to a single level optimization problem. However, this approach is only valid under some strong conditions. Moreover the approach can only be used under the assumption that the optimal action of the principal-agent problem and its relaxed problem appears only at an interior point. In this thesis, we consider a new relaxed problem. Under more general assumptions. we can solve the principal-agent problem without restricting the optimal action of the agent to be in the interior.
Key concepts: Principal (computer security), Mathematics education, Mathematics, Computer science, Computer security