IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v392y2013i21p5387-5398.html
   My bibliography  Save this article

The value of less connected agents in Boolean networks

Author

Listed:
  • Epstein, Daniel
  • Bazzan, Ana L.C.

Abstract

In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality that help to see how agents are organized.

Suggested Citation

  • Epstein, Daniel & Bazzan, Ana L.C., 2013. "The value of less connected agents in Boolean networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(21), pages 5387-5398.
  • Handle: RePEc:eee:phsmap:v:392:y:2013:i:21:p:5387-5398
    DOI: 10.1016/j.physa.2013.07.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437113005876
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

    File URL: https://libkey.io/10.1016/j.physa.2013.07.004?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.

    References listed on IDEAS

    as
    1. Johnson, N.F. & Jarvis, S. & Jonson, R. & Cheung, P. & Kwong, Y.R. & Hui, P.M., 1998. "Volatility and agent adaptability in a self-organizing market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 258(1), pages 230-236.
    2. Arthur, W Brian, 1994. "Inductive Reasoning and Bounded Rationality," American Economic Review, American Economic Association, vol. 84(2), pages 406-411, May.
    3. Thorsten Chmura & Thomas Pitz, 2007. "An Extended Reinforcement Algorithm for Estimation of Human Behaviour in Experimental Congestion Games," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 10(2), pages 1-1.
    4. W. Brian Arthur, 1994. "Inductive Reasoning, Bounded Rationality and the Bar Problem," Working Papers 94-03-014, Santa Fe Institute.
    5. Challet, D. & Zhang, Y.-C., 1997. "Emergence of cooperation and organization in an evolutionary game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 246(3), pages 407-418.
    6. Bruce Edmonds, 1999. "Gossip, Sexual Recombination and the El Farol Bar: Modelling the Emergence of Heterogeneity," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 2(3), pages 1-2.
    7. Challet, Damien & Zhang, Yi-Cheng, 1998. "On the minority game: Analytical and numerical studies," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 256(3), pages 514-532.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Pelz, Matthew & Velcsov, Mihaela T., 2022. "Entropy analysis of Boolean network reduction according to the determinative power of nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 589(C).
    2. Li, Fangfei & Li, Jianning & Shen, Lijuan, 2018. "State feedback controller design for the synchronization of Boolean networks with time delays," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 1267-1276.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chmura, Thorsten & Pitz, Thomas, 2004. "Minority Game: Experiments and Simulations of Traffic Scenarios," Bonn Econ Discussion Papers 23/2004, University of Bonn, Bonn Graduate School of Economics (BGSE).
    2. Kets, W., 2007. "The Minority Game : An Economics Perspective," Other publications TiSEM 65d52a6a-b27d-45a9-93a7-e, Tilburg University, School of Economics and Management.
    3. Marsili, Matteo & Challet, Damien & Zecchina, Riccardo, 2000. "Exact solution of a modified El Farol's bar problem: Efficiency and the role of market impact," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 280(3), pages 522-553.
    4. Cross, Rod & Grinfeld, Michael & Lamba, Harbir & Seaman, Tim, 2005. "A threshold model of investor psychology," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 354(C), pages 463-478.
    5. Andersen, Jørgen Vitting & de Peretti, Philippe, 2021. "Heuristics in experiments with infinitely large strategy spaces," Journal of Business Research, Elsevier, vol. 129(C), pages 612-620.
    6. Chmura, T. & Pitz, T., 2006. "Successful strategies in repeated minority games," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 363(2), pages 477-480.
    7. Yamada, Takashi & Hanaki, Nobuyuki, 2016. "An experiment on Lowest Unique Integer Games," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 88-102.
    8. Jørgen Vitting Andersen & Philippe de Peretti, 2020. "Heuristics in experiments with infinitely large strategy spaces," Post-Print hal-02435934, HAL.
    9. Linde, Jona & Sonnemans, Joep & Tuinstra, Jan, 2014. "Strategies and evolution in the minority game: A multi-round strategy experiment," Games and Economic Behavior, Elsevier, vol. 86(C), pages 77-95.
    10. Ferreira, Fernando F & Francisco, Gerson & Machado, Birajara S & Muruganandam, Paulsamy, 2003. "Time series analysis for minority game simulations of financial markets," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 321(3), pages 619-632.
    11. Bottazzi, Giulio & Devetag, Giovanna, 2003. "A laboratory experiment on the minority game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 324(1), pages 124-132.
    12. Jørgen Vitting Andersen & Philippe de Peretti, 2020. "Heuristics in experiments with infinitely large strategy spaces," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-02435934, HAL.
    13. Vee-Liem Saw & Lock Yue Chew, 2020. "No-boarding buses: Synchronisation for efficiency," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-34, March.
    14. Kets, W., 2008. "Networks and learning in game theory," Other publications TiSEM 7713fce1-3131-498c-8c6f-3, Tilburg University, School of Economics and Management.
    15. Wawrzyniak, Karol & Wiślicki, Wojciech, 2012. "Mesoscopic approach to minority games in herd regime," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(5), pages 2056-2082.
    16. Matteo Marsili & Damien Challet, 2001. "Trading Behavior And Excess Volatility In Toy Markets," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 4(01), pages 3-17.
    17. Płatkowski, Tadeusz & Ramsza, Michał, 2003. "Playing minority game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 323(C), pages 726-734.
    18. Mansilla, R, 2000. "From naive to sophisticated behavior in multiagents-based financial market models," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 284(1), pages 478-488.
    19. Linde, Jona & Gietl, Daniel & Sonnemans, Joep & Tuinstra, Jan, 2023. "The effect of quantity and quality of information in strategy tournaments," Journal of Economic Behavior & Organization, Elsevier, vol. 211(C), pages 305-323.
    20. J{o}rgen Vitting Andersen & Philippe de Peretti, 2020. "Heuristics in experiments with infinitely large strategy spaces," Papers 2005.02337, arXiv.org.

    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:eee:phsmap:v:392:y:2013:i:21:p:5387-5398. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.