Related papers: Phase transition in the Kolkata Paise Restaurant p…

For online resource allocation problems, we propose a new demand arrival model where the sequence of arrivals contains both an adversarial component and a stochastic one. Our model requires no demand forecasting; however, due to the…

We consider the dynamics of player's strategies in repeated market games, where the selection of strategies is determined by a learning model. Prior theoretical analysis and experimental data show that after large number of plays the…

As general theories, currently there are concentration inequalities (of random walk) only for the cases of independence and martingale differences. In this paper, the concentration inequalities are extended to more general situations. In…

We study analytically and by computer simulations a complex system of adaptive agents with finite memory. Borrowing the framework of the Minority Game and using the replica formalism we show the existence of an equilibrium phase transition…

We explore a two-step optimization problem in random environments, the so-called restaurant-coffee shop problem, where a walker aims at visiting the nearest and better restaurant in an area and then move to the nearest and better…

In this paper, we analyze a discrete-time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count…

Consider a population of customers each of which needs to decide independently when to arrive to a facility that provides a service during a fixed period of time, say a day. This is a common scenario in many service systems such as a bank,…

In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the uniform probability model and the fixed ratio model. For the…

We discover the mechanism for the transition from self-segregation (into opposing groups) to clustering (towards cautious behaviors) in the evolutionary minority game (EMG). The mechanism is illustrated with a statistical mechanics analysis…

Probabilistic storage and retrieval (PSR) of unitary quantum dynamics is possible with exponentially small failure probability with respect to the number of systems used as a quantum memory [PRL 122, 170502 (2019)]. Here we study…

Real-world recommendation systems often consist of two phases. In the first phase, multiple predictive models produce the probability of different immediate user actions. In the second phase, these predictions are aggregated according to a…

We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service control. The service rate switches between a low and a high value depending on system congestion. Arriving customers do not observe the…

We introduce the stochastic Network-Iterated Prisoner's Dilemma (NIPD) model, a network of players playing the Prisoner's Dilemma with their neighbours, each with a memory-one strategy which they constantly and locally update to improve…

We consider sojourn (or response) times in processor-shared queues that have a finite customer capacity. Computing the response time of a tagged customer involves solving a finite system of linear ODEs. Writing the system in matrix form, we…

We explore how different types and uses of memory can aid spatial navigation in changing uncertain environments. In the simple foraging task we study, every day, our agent has to find its way from its home, through barriers, to food.…

We study network revenue management problems motivated by applications such as railway ticket sales and hotel room bookings. Requests, each requiring a resource for a consecutive stay, arrive sequentially with known arrival probabilities.…

We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects.…

The classical Hotelling game is played on a line segment whose points represent uniformly distributed clients. The $n$ players of the game are servers who need to place themselves on the line segment, and once this is done, each client gets…

Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical…

We consider competitive facility location as a two-stage multi-agent system with two types of clients. For a given host graph with weighted clients on the vertices, first facility agents strategically select vertices for opening their…