相关论文: Kolkata Restaurant Problem as a generalised El Far…

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…

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…

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…

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…

In this article, we present a brief narration of the origin and the overview of the recent developments done on the Kolkata Paise Restaurant (KPR) problem, which can serve as a prototype for a broader class of resource allocation problems…

A novel phase transition behaviour is observed in the Kolkata Paise Restaurant (KPR) problem where large number ($N$) of agents or customers collectively (and iteratively) learn to choose among the $N$ restaurants where she would expect to…

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…

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…

This article is concerned with the global behavior of agents in the El Farol bar problem. In particular, we discuss the global attendance in terms of its mean and variance, and show that there is a strong dependence of both on the…

The El Farol Bar Problem is a classic computational economics problem in which agents attempt to attend a weekly event at a bar only if it is not too crowded. Each agent has access to multiple competing strategies that may be used to…

We mathematize El Farol bar problem and transform it into a workable model. In general, the average convergence to optimality at the collective level is trivial and does not even require any intelligence on the side of agents. Secondly,…

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…

We consider the El Farol bar problem, also known as the minority game (W. B. Arthur, ``The American Economic Review'', 84(2): 406--411 (1994), D. Challet and Y.C. Zhang, ``Physica A'', 256:514 (1998)). We view it as an instance of the…

One of the principal statistical features characterizing the activity in financial markets is the distribution of fluctuations in market indicators such as the index. While the developed stock markets, e.g., the New York Stock Exchange…

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…

Financial markets can be seen as complex systems in non-equilibrium steady state, one of whose most important properties is the distribution of price fluctuations. Recently, there have been assertions that this distribution is qualitatively…

We investigate a disordered variant of Pitman's Chinese restaurant process where tables carry i.i.d. weights. Incoming customers choose to sit at an occupied table with a probability proportional to the product of its occupancy and its…

The fractional Calder\'on problem asks to determine the unknown coefficients in a nonlocal, elliptic equation of fractional order from exterior measurements of its solutions. There has been substantial work on many aspects of this inverse…

The El Farol bar model, proposed to study the dynamics of competition of agents in a variety of contexts (W. B. Arthur, Amer. Econ. Assoc. Pap. and Proc. 84, 406 (1994)) is studied. We characterize in detail the three regions of the phase…

We address in this paper the problem of modifying both profits and costs of a fractional knapsack problem optimally such that a prespecified solution becomes an optimal solution with prespect to new parameters. This problem is called the…