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?Solution
Fish caught by “i”: a i (2000- (a i + Σ j≠i a j )). Now we have to maximise this expression. Therefore differentiating w.r.t ai and equating to 0 a i = 1000 - Σ j≠i a j /2 Now each player will try to maximise his catch and assuming each one using the same strategy a i = a * to achieve equilibrium a* = 1000 - (n-1) a* /2 a* = 2000 / (n+1) So catch by each player=[2000 / (n+1)] 2
What was the theme for World AIDS Day 2022?
Which city hosted the 2024 Cannes Film Festival where the Bharat Pavilion was inaugurated?
Who unveiled the groundbreaking book titled ‘Artificial Intelligence and National Security,’ at the Defence Literature Festival, “Kalam and Kavach...
As per ISA’s World Solar Report, what was the global solar capacity in 2023, showing growth from 1.22 GW in 2000?
How many medals did the Indian team win at the 13th European Girls’ Mathematical Olympiad ( EGMO) 2024 in Tskaltubo, Georgia?
Sarvam AI recently launched a language model focused on Indian languages. What is it called?
Which technology does Airbus and CSIR-IIP plan to use for developing sustainable aviation fuel (SAF) in India?
Which of the followings type of NBFCs is not registered with RBI?
What is the target renewable energy capacity that IOCL aims to achieve by 2030?
What is the capital of Namibia?