Related papers: The Saga of KPR: Theoretical and Experimental deve…
The Kolkata Paise Restaurant Problem is a challenging game, in which $n$ agents must decide where to have lunch during their lunch break. The game is very interesting because there are exactly $n$ restaurants and each restaurant can…
We study the dynamics of the "Kolkata Paise Restaurant problem". The problem is the following: In each period, N agents have to choose between N restaurants. Agents have a common ranking of the restaurants. Restaurants can only serve one…
We study the dynamics of some uniform learning strategy limits or a probabilistic version of the "Kolkata Paise Restaurant" problem, where N agents choose among N equally priced but differently ranked restaurants every evening such that…
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…
We study the dynamics of a few stochastic learning strategies for the 'Kolkata Paise Restaurant' problem, where N agents choose among N equally priced but differently ranked restaurants every evening such that each agent tries get to dinner…
We will review the results for stochastic learning strategies, both classical (one-shot and iterative) and quantum (one-shot only), for optimizing the available many-choice resources among a large number of competing agents, developed over…
We study the Kolkata Paise Restaurant Problem (KPRP) with multiple dining clubs, extending work in [A. Harlalka, A. Belmonte and C. Griffin, \textit{Physica A}, 620:128767, 2023]. In classical KPRP, $N$ agents chose among $N$ restaurants at…
The Quantum Kolkata restaurant problem is a multiple-choice version of the quantum minority game, where a set of n non-communicating players have to chose between one of m choices. A payoff is granted to the players that make a unique…
Demand outstrips available resources in most situations, which gives rise to competition, interaction and learning. In this article, we review a broad spectrum of multi-agent models of competition (El Farol Bar problem, Minority Game,…
In today's dynamic and interconnected world, resource constraints pose significant challenges across various domains, ranging from networks, logistics and manufacturing to project management and optimization, etc. Resource-constrained…
We introduce the idea of a dining club to the Kolkata Paise Restaurant Problem. In this problem, $N$ agents choose (randomly) among $N$ restaurants, but if multiple agents choose the same restaurant, only one will eat. Agents in the dining…
The objective of the KPR agents are to learn themselves in the minimum (learning) time to have maximum success or utilization probability ($f$). A dictator can easily solve the problem with $f = 1$ in no time, by asking every one to form a…
Resource allocation is the process of optimizing the rare resources. In the area of security, how to allocate limited resources to protect a massive number of targets is especially challenging. This paper addresses this resource allocation…
The generalization of the problem of adaptive competition, known as the minority game, to the case of $K$ possible choices for each player is addressed, and applied to a system of interacting perceptrons with input and output units of the…
Three player quantum Kolkata restaurant problem is modeled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a $N$-choice generalization of the $N$-player quantum minority game. It…
A dynamical model for the distribution of resources between competing agents is studied. While global competition leads to the accumulation of all the resources by a single agent, local competition allows for a wider resource distribution.…
Public resource allocation involves the efficient distribution of resources, including urban infrastructure, energy, and transportation, to effectively meet societal demands. However, existing methods focus on optimizing the movement of…
This paper proposes the Potluck Problem as a model for the behavior of independent producers and consumers under standard economic assumptions, as a problem of resource allocation in a multi-agent system in which there is no explicit…
In Part I of this two-part paper [1], we proposed a new game, called Chinese restaurant game, to analyze the social learning problem with negative network externality. The best responses of agents in the Chinese restaurant game with…
The sustainable use of common-pool resources (CPRs) is a major environmental governance challenge because of their possible over-exploitation. Research in this field has overlooked the feedback between user decisions and resource dynamics.…