Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information

Diptesh Ghosh () and Anindya S. Chakrabarti

Papers from arXiv.org

Abstract: In this paper, we study a large-scale distributed coordination problem and propose efficient adaptive strategies to solve the problem. The basic problem is to allocate finite number of resources to individual agents such that there is as little congestion as possible and the fraction of unutilized resources is reduced as far as possible. In the absence of a central planner and global information, agents can employ adaptive strategies that uses only finite knowledge about the competitors. In this paper, we show that a combination of finite information sets and reinforcement learning can increase the utilization rate of resources substantially.

Date: 2017-02
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://arxiv.org/pdf/1702.01017 Latest version (application/pdf)

Related works:
Journal Article: Emergence of distributed coordination in the Kolkata Paise Restaurant problem with finite information (2017)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1702.01017

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().