Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information
arXiv:1702.01017 · doi:10.1016/j.physa.2017.04.171
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.
arXiv comment12 pages, 4 figures
References in corpus (5)
- Self-organized Networks of Competing Boolean Agents
- The Kolkata Paise Restaurant Problem and Resource Utilization
- Statistics of the Kolkata Paise Restaurant Problem
- Collaborate, compete and share
- When Big Data Fails! Relative success of adaptive agents using coarse-grained information to compete for limited resources
Cited by in corpus (4)
- Development of Econophysics: A biased account and perspective from Kolkata
- Stability of Dining Clubs in the Kolkata Paise Problem with and without Cheating
- The Saga of KPR: Theoretical and Experimental developments
- Achieving Maximum Utilization in Optimal Time for Learning or Convergence in the Kolkata Paise Restaurant Problem