The Mathematics of principal-agent problem with adverse selection
| dc.contributor.author | Shadnam, Mojdeh | |
| dc.contributor.supervisor | Agueh, Martial | |
| dc.contributor.supervisor | Ye, Juan Juan | |
| dc.date.accessioned | 2011-08-19T20:13:02Z | |
| dc.date.available | 2011-08-19T20:13:02Z | |
| dc.date.copyright | 2011 | en_US |
| dc.date.issued | 2011-08-19 | |
| dc.degree.department | Department of Mathematics and Statistics | |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | This thesis studies existence and characterization of optimal solutions to the principal-agent problem with adverse selection for both discrete and continuous problems. The existence results are derived by the abstract concepts of differentiability and convexity. Under the Spence Mirrlees condition, we show that the discrete problem reduces to a problem that always satisfies the linear independence constraint qualification, while the continuum of type problem becomes an optimal control problem. We then use the Ellipsoid algorithm to solve the problem in the discrete and convex case. For the problem without the Spence Mirrlees condition, we consider different classes of constraint qualifications. Then we introduce some easy-to-check conditions to verify these constraint qualifications. Finally we give economic interpretations for several numerical examples. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/3482 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights.temp | Available to the World Wide Web | en_US |
| dc.subject | Principal-agent problem | en_US |
| dc.subject | Adverse selection | en_US |
| dc.title | The Mathematics of principal-agent problem with adverse selection | en_US |
| dc.type | Thesis | en_US |