Advanced Search
MyIDEAS: Login

Co-evolution of bounded rational agents in adaptive social networks

Contents:

Author Info

  • Lugo, H.
  • Dalmagro

    ()
    (Dpto. Cómputo Científico y Estadístic Universidad Simón Bolívar)

  • F. Jiménez J.

Abstract

Models based on agents has been widely used to study the paradigmatic emergence of cooperation in social systems. In the Spatial Prisoners' Dilemma game introduced by Martin Nowak and Robert May, the agents are greedy and imitate indiscriminately the action of the wealthiest neighbor. Other strategies, for example stochastic or pavlovian, have also been considered showing similar results as the greedy rule. That is, in general matter, the asymptotic emergence or maintenance of cooperation. For these spatial models, it can be proved, and that is the dilemma, that cooperation extinguishes when agents exhibit completely rational behavior. In this work, we explore the behavior of a system with bounded rational agents. For that, we consider a modified Spatial Prisoners' Dilemma on an adaptive network where each agent can play different actions with different neighbors. The co-evolutive dynamic obeys a scheme of rational imitation of the wealthiest agent of each neighborhood. We show the existence of a phase transition (absence of cooperation - presence of cooperation) that depends on the incentive to defect. We compute the critical value and report a simulation study that evidences that the emergence or survival of cooperation at the steady state is a critical phenomenon. These results provide a fascinating point of view to understand the trade-off between cooperation and rationality in wealthy societies. Our results also include the emergence of a rich social structure living in asymptotic regimen. Throughout a simulation study, we analyze the distribution of wealth and other complex aspects of the social network at the steady state

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2005 with number 354.

as in new window
Length:
Date of creation: 11 Nov 2005
Date of revision:
Handle: RePEc:sce:scecf5:354

Contact details of provider:
Email:
Web page: http://comp-econ.org/
More information through EDIRC

Related research

Keywords: Models based on agents; Cooperation; Prisoner’s Dilemma;

Find related papers by JEL classification:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:sce:scecf5:354. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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