IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v7y2016i1d10.1038_ncomms11125.html
   My bibliography  Save this article

Extortion can outperform generosity in the iterated prisoner’s dilemma

Author

Listed:
  • Zhijian Wang

    (Experimental Social Science Laboratory, Zhejiang University
    College of Economics, Zhejiang University)

  • Yanran Zhou

    (Experimental Social Science Laboratory, Zhejiang University
    College of Economics, Zhejiang University)

  • Jaimie W. Lien

    (The Chinese University of Hong Kong
    School of Economics and Management, Tsinghua University)

  • Jie Zheng

    (School of Economics and Management, Tsinghua University
    Esther Lee Building, Room 1013, The Chinese University of Hong Kong)

  • Bin Xu

    (College of Economics, Zhejiang Gongshang University)

Abstract

Zero-determinant (ZD) strategies, as discovered by Press and Dyson, can enforce a linear relationship between a pair of players’ scores in the iterated prisoner’s dilemma. Particularly, the extortionate ZD strategies can enforce and exploit cooperation, providing a player with a score advantage, and consequently higher scores than those from either mutual cooperation or generous ZD strategies. In laboratory experiments in which human subjects were paired with computer co-players, we demonstrate that both the generous and the extortionate ZD strategies indeed enforce a unilateral control of the reward. When the experimental setting is sufficiently long and the computerized nature of the opponent is known to human subjects, the extortionate strategy outperforms the generous strategy. Human subjects’ cooperation rates when playing against extortionate and generous ZD strategies are similar after learning has occurred. More than half of extortionate strategists finally obtain an average score higher than that from mutual cooperation.

Suggested Citation

  • Zhijian Wang & Yanran Zhou & Jaimie W. Lien & Jie Zheng & Bin Xu, 2016. "Extortion can outperform generosity in the iterated prisoner’s dilemma," Nature Communications, Nature, vol. 7(1), pages 1-7, September.
  • Handle: RePEc:nat:natcom:v:7:y:2016:i:1:d:10.1038_ncomms11125
    DOI: 10.1038/ncomms11125
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/ncomms11125
    File Function: Abstract
    Download Restriction: no

    File URL: https://libkey.io/10.1038/ncomms11125?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ding, Shasha & Sun, Hao & Sun, Panfei & Han, Weibin, 2022. "Dynamic outcome of coopetition duopoly with implicit collusion," Chaos, Solitons & Fractals, Elsevier, vol. 160(C).
    2. Kang, Kai & Tian, Jinyan & Zhang, Boyu, 2024. "Cooperation and control in asymmetric repeated games," Applied Mathematics and Computation, Elsevier, vol. 470(C).
    3. Jie, Yingmo & Liu, Charles Zhechao & Choo, Kim-Kwang Raymond & Guo, Cheng, 2024. "An incentive compatible ZD strategy-based data sharing model for federated learning: A perspective of iterated prisoner's dilemma," European Journal of Operational Research, Elsevier, vol. 315(2), pages 764-776.
    4. Masahiko Ueda, 2022. "Controlling Conditional Expectations by Zero-Determinant Strategies," SN Operations Research Forum, Springer, vol. 3(3), pages 1-22, September.
    5. Taha, Mohammad A. & Ghoneim, Ayman, 2021. "Zero-determinant strategies in infinitely repeated three-player prisoner's dilemma game," Chaos, Solitons & Fractals, Elsevier, vol. 152(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:natcom:v:7:y:2016:i:1:d:10.1038_ncomms11125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.