Question

Suppose there is a pond with fishes and “n” number of fishermen living around it. Let a i is time spent fishing per day by player
i. Thus total time per day is a 1 + ... + a n. The number of fish available at any time is given by: (2000- Σ i a i ). The number of fish caught by a fisherman “j” is: a j (2000- Σ i a i ). Then what would be the best response of fisherman “i” to maximise his total?

A (n+1)2
B n2
C [6000 / (n+1)]2
D [2000 / (n+1)]2
Practice Next

Hey! Ask a query