Question
Please help me with this problem set: Ex:3 You are the dean of the faculty at St. Anford University. You hire assistant professors for a
Please help me with this problem set:
Ex:3
You are the dean of the faculty at St. Anford University. You hire assistant professors for a probationary period of seven years, after which they come up for tenure and are either promoted and gain a job for life or turned down, in which case they must find a job elsewhere. Your assistant professors come in two types, Good and Brilliant. You cannot directly distinguish between Good and Brilliant types. Each individual assistant professor knows whether he or she is the Brilliant or merely Good. You would like to tenure only the Brilliant type.
The payoff from a tenured career at St. Anford is $2 million. Anyone denied tenure at St. Anford will get a faculty position at Boondocks College, and the value today of that career is $0.5 million. Your faculty can do research and publish the findings. But each publication requires effort and time and causes strain on the family; all these are costly to the faculty member. The monetary equivalent of this cost is $30'000 per publication for a Brilliant assistant professor and $60'000 per publication for a Good one. You can set a minimum number N of publications that an assistant professor must produce in order to achieve tenure.
(a)Without doing any math, describe, as completely as you can, what would happen in a separating equilibrium to this game.
(b)There are two potential types of pooling outcomes to this game. Without doing any math, describe what they would look like, as completely as you can.
(c)What is the set of possible N that will accomplish your goal of screening the brilliant professors out from the merely Good ones?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started