Emergence of Distributed Coordination in the Kolkata Paise Restaurant Problem with Finite Information
It addresses distributed coordination for resource allocation in multi-agent systems with limited information, offering a practical solution for large-scale problems.
The paper proposes adaptive strategies combining finite information and reinforcement learning to improve resource utilization in the Kolkata Paise Restaurant Problem, achieving substantial increases in utilization rate without central coordination or global information.
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.