Consider the following Management - Trainee game. There are two types of trainees: Lazy type and
Industrious type. Suppose the value to the trainee from being hired is 130 and from not getting a position is
70. He has options in terms of the amount of efforts: 40 and 80 hours and the personal cost to him depends
on his type, as expressed in the table below. The trainee's payoff is the value of being hired (or not) less the
personal cost of effort. For example, if a lazy type works 40 hours and gets the position, then his payoff is 130
- 50 = 70, while his payoff if he doesn't get the position is 70 - 50 = 20. The manager's payoff is 100 from
hiring an industrious worker; 25 from hiring a lazy worker, and 60 from hiring no one.
Personal Cost of Effort
Type 40 Hours 80 Hours
Lazy 50 140
Industrious 30 80
The trainee gets to know his exact type (lazy or industrious), but the manager does not know the trainee's exact
type. Prior to observing the trainee's effort, the manager believes that the trainee is lazy with probability 0.75
and industrious with probability 0.25. (This is the manager's prior belief. The belief has the implication that
unless the manager is able acquire more information about the trainee's type, she will not hire the trainee
because the expected payoff from hiring him is $0.75 \times 25 + 0.25 \times 43.75$, which is less than the payoff of
60 from leaving the position open.)
A strategy of the trainee assigns an action - work 40 hours or 80 hours - to each possible type - lazy or
industrious. while a strategy for the manager assigns an action - hire or fire - to each possible action of the
Digit 1 Appears in Sequence from 1 to $n$
Question 73 How many times does the digit 1 occur in the integers from 1 to $n$?
For example, if $n$ is 12, there are four numbers from 1 to 12 containing the digit 1, which are 1, 10, 11, and 12,
and the digit 1 occurs five times.
Straightforward but Inefficient
The intuitive way to solve this problem is to get a count of digit 1 in each number. The least important
digit in a decimal number can be calculated with the modulo operator (%). If the number is greater than