Minimum effort game

Last updated

In game theory, the minimum effort game or weakest link game is a game in which each person decides how much effort to put in and is rewarded based on the least amount of effort anyone puts in. [1] It is assumed that the reward per unit of effort is greater than the cost per unit effort, otherwise there would be no reason to put in effort.

Contents

Examples

Nash equilibria

Source: [2]

If there are players, the set of effort levels is , it costs each player dollars to put in one unit of effort, and each player is rewarded dollars for each unit of effort the laziest person puts in, then there are pure-strategy Nash equilibria, one for each , with each player putting in the same amount of effort , because putting more effort costs more money without extra reward, and because putting less effort reduces the reward earned.

There are non pure Nash equilibria, given as follows: each player chooses two effort levels and puts in units of effort with probability and units of effort with probability .

In practice

The amount of effort players put in depends on the amount of effort they think other players will put in. [3] In addition, some players will put more effort than expected in an attempt to get others to put in more effort.

References

  1. 1 2 Riedl, Arno; Rohde, Ingrid M. T.; Strobel, Martin (April 2016). "Efficient Coordination in Weakest-Link Games" (PDF). The Review of Economic Studies. 83 (2): 737–767. doi:10.1093/restud/rdv040. ISSN   0034-6527.
  2. Cartwright, Edward (9 June 2018). "The Optimal Strategy in the Minimum Effort Game" (PDF). Games. 9 (3). MDPI: 42. doi: 10.3390/g9030042 . ISSN   2073-4336.
  3. Feri, Francesco; Gantner, Anita; Moffatt, Peter G.; Erharter, Dominik (13 October 2022). "Leading to efficient coordination: Individual traits, beliefs and choices in the minimum effort game". Games and Economic Behavior. 136: 403–427. doi: 10.1016/j.geb.2022.10.003 .