¬ã°Q¤é´Á |
2014¦~12¤ë27¤é10:30 ~ 13:00 |
¬ã°Q¦aÂI |
¥x¤jªÀ·|¬ì¾Ç°|710°Q½×«Ç |
ÃD¥Ø |
A Tenure-Clock Problem |
§@ªÌ |
Chia-Hui Chen and Junichiro Ishida |
¤åÄm¥X³B |
Working paper |
³ø§i¤H |
Junichiro Ishida |
°Ñ¥[¤Hû |
Junichiro Ishida¡BSusumu Cato¡B¶ÀÂE¡BªL¿P²Q¡B´^¥¿¯E¡B³¯ª÷²±¡B¤Bi¤¯¡B§d©|«Ù¡B§f¶®´D¡B±ä¥j¾s¡B¬IÎr¥þ |
ºKn |
We consider a ¡§tenure-clock problem¡¨ in
which a principal may set a deadline by which she needs to evaluate an
agent¡¦s ability and decides whether to promote him or not. We embed this
problem in a continuous-time model with both hidden action and hidden information,
where the principal must induce the agent to exert effort to facilitate her learning process. The
value of committing to a deadline is examined in this environment, and
factors that make the deadline more profitable are identified. Our simple
framework allows us to obtain a complete characterization of the equilibrium,
both with and without commitment, and provides insight into why up-or-out contracts
are prevalent in some industries while they are almost non-existent in
others. |