# Cooperation amongst competing agents in minority games

## Author Info

• Deepak Dhar
• V. Sasidevan
• Bikas K. Chakrabarti
Registered author(s):

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

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://arxiv.org/pdf/1102.4230

## Bibliographic Info

Paper provided by arXiv.org in its series Papers with number 1102.4230.

as in new window
Length:
Date of revision:
Handle: RePEc:arx:papers:1102.4230

Contact details of provider:
Web page: http://arxiv.org/

## Related research

Keywords:

This paper has been announced in the following NEP Reports:

## References

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

## Lists

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

## Corrections

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

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.