Related papers: Queue-length Variations In A Two-Restaurant Proble…
We consider a one-dimensional stochastic reaction-diffusion generalizing the totally asymmetric simple exclusion process, and aiming at describing single lane roads with vehicles that can change speed. To each particle is associated a jump…
We discuss a model of motion of substance through the nodes of a channel of a network. The channel can be modeled by a chain of urns where each urn can exchange substance with the neighboring urns. In addition the urns can exchange…
This paper concerns the long term behaviour of a growth model describing a random sequential deposition of particles on a finite graph. The probability of allocating a particle at a vertex is proportional to a log-linear function of numbers…
We introduce a general methodology of update rules accounting for arbitrary interevent time distributions in simulations of interacting agents. In particular we consider update rules that depend on the state of the agent, so that the update…
We study the existence of fair distributions when we have more guests than pieces to allocate, focusing on envy-free distributions among those who receive a piece. The conditions on the demand from the guests can be weakened from those of…
We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it -…
In this paper we investigate an M/M/$\infty$ queue whose parameters depend on an external random environment that we assume to be a semi-Markovian process with finite state space. For this model we show a recursive formula that allows to…
We consider the queuing networks, which are made from servers, exchanging their positions. The customers, using the network, try to reach their destinations, which is complicated by the movements of the servers, taking their customers with…
We study a problem where a group of agents has to decide how some fixed value should be shared among them. We are interested in settings where the share that each agent receives is based on how that agent is evaluated by other members of…
In the supermarket model, there are $n$ queues, each with a single server. Customers arrive in a Poisson process with arrival rate $\lambda n$, where $\lambda = \lambda (n) \in (0,1)$. Upon arrival, a customer selects $d=d(n)$ servers…
Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension…
We compare different approximations for the wait time in distribution networks, in which all warehouses use an (R,Q)-order policy. Reporting on the results of extensive computational experiments, we evaluate the quality of several…
We consider a truthful facility location problem with agents that have private positions on the line of real numbers and known optional preferences over two obnoxious facilities that must be placed at locations chosen from a given set of…
Sequential allocation is a simple allocation mechanism in which agents are given pre-specified turns and each agents gets the most preferred item that is still available. It has long been known that sequential allocation is not…
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 use the framework of multivariate regular variation to analyse the extremal behaviour of preferential attachment models. To this end, we follow a directed linear preferential attachment model for a random, heavy-tailed number of steps in…
We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in…
We initiate the study of the heterogeneous facility location problem with limited resources. We mainly focus on the fundamental case where a set of agents are positioned in the line segment [0,1] and have approval preferences over two…
The queue system,with Poisson arrivals,constant service time and infinite servers, busy period distribution is intensively studied because, due to its probability density function quite easy interpretation, it may serve as a clue to…
We consider a single server queueing system with admission control and the possibility to switch dynamically between a low and a high service rate, and examine the benefit of this service rate flexibility. We formulate a discounted Markov…