IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1102.4230.html
   My bibliography  Save this paper

Cooperation amongst competing agents in minority games

Author

Listed:
  • Deepak Dhar
  • V. Sasidevan
  • Bikas K. Chakrabarti

Abstract

We study a variation of the minority game. There are N agents. Each has to choose between one of two alternatives everyday, and there is reward to each member of the smaller group. The agents cannot communicate with each other, but try to guess the choice others will make, based only the past history of number of people choosing the two alternatives. We describe a simple probabilistic strategy using which the agents acting independently, can still maximize the average number of people benefitting every day. The strategy leads to a very efficient utilization of resources, and the average deviation from the maximum possible can be made of order $(N^{\epsilon})$, for any $\epsilon >0$. We also show that a single agent does not expect to gain by not following the strategy.

Suggested Citation

  • Deepak Dhar & V. Sasidevan & Bikas K. Chakrabarti, 2011. "Cooperation amongst competing agents in minority games," Papers 1102.4230, arXiv.org.
  • Handle: RePEc:arx:papers:1102.4230
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1102.4230
    File Function: Latest version
    Download Restriction: no

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:1102.4230. 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: (arXiv administrators). General contact details of provider: http://arxiv.org/ .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.