IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v11y2000i08ns0129183100001334.html
   My bibliography  Save this article

On Local Prisoner'S Dilemma Game With Pareto Updating Rule

Author

Listed:
  • E. AHMED

    (Mathematics Department, Faculty of Science, Al-Ain P. O. Box 17551, United Arab Emirates;
    Mathematics Department, Faculty of Science, Mansoura University, Mansoura 35516, Egypt)

  • A. S. ELGAZZAR

    (Mathematics Department, Faculty of Education, El-Arish 45111, Egypt)

Abstract

Prisoner's Dilemma games with two and three strategies are studied. The corresponding replicator equations, their steady states and their asymptotic stability are discussed. Local Prisoner's Dilemma games are studied using Pareto optimality. As in the case with Nash updating rule, the existence of tit for tat strategy is crucial to imply cooperation even in one dimension. Pareto updating implies less erratic behavior since the steady state configurations are mostly fixed points or at most 2-cycle. Finally, Prisoner's Dilemma game is simulated on small-world networks which are closer to real systems than regular lattices. There are no significant changes compared to the results of the regular lattice.

Suggested Citation

  • E. Ahmed & A. S. Elgazzar, 2000. "On Local Prisoner'S Dilemma Game With Pareto Updating Rule," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 11(08), pages 1539-1544.
    • Handle: RePEc:wsi:ijmpcx:v:11:y:2000:i:08:n:s0129183100001334
    DOI: 10.1142/S0129183100001334
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183100001334
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183100001334?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Elgazzar, Ahmed S., 2020. "Quantum prisoner’s dilemma in a restricted one-parameter strategic space," Applied Mathematics and Computation, Elsevier, vol. 370(C).

    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:wsi:ijmpcx:v:11:y:2000:i:08:n:s0129183100001334. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.