Related papers: Queue-length Variations In A Two-Restaurant Proble…
In the Seat Arrangement problem the goal is to allocate agents to vertices in a graph such that the resulting arrangement is optimal or fair in some way. Examples include an arrangement that maximises utility or one where no agent envies…
The $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. We present a model generalizing the $k$-Server Problem by preferences of the requests, where the…
P\'{o}lya urn is a stochastic process in which balls are randomly drawn from an urn of red and blue balls, and balls of the same color as the drawn balls are added. The probability of a ball of a certain color being drawn is equal to the…
A single server retrial queueing system with two-classes of orbiting customers, and general class dependent service times is considered. If an arriving customer finds the server unavailable, it enters a virtual queue, called the orbit,…
We present results for the so-called `bar-attendance' model of market behavior: $p$ adaptive agents, each possessing $n$ prediction rules chosen randomly from a pool, attempt to attend a bar whose cut-off is $s$. The global attendance…
P{\'o}lya urns are urns where at each unit of time a ball is drawn and is replaced with some other balls according to its colour. We introduce a more general model: The replacement rule depends on the colour of the drawn ball and the value…
Retrial phenomenon naturally arises in various systems such as call centers, cellular networks and random access protocols in local area networks. This paper gives a comprehensive survey on theory and applications of retrial queues in these…
An agent-based model for financial markets has to incorporate two aspects: decision making and price formation. We introduce a simple decision model and consider its implications in two different pricing schemes. First, we study its…
In recent years, there is a growing research about queueing models with customers who choose their service durations. In general, the model assumptions in the existing literature imply that every customer knows his service demand when he…
We study many-server queues with abandonment in which customers have general service and patience time distributions. The dynamics of the system are modeled using measure- valued processes, to keep track of the residual service and patience…
We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic…
We consider a simplified model of the continuous double auction where prices are integers varying from $1$ to $N$ with limit orders and market orders, but quantity per order limited to a single share. For this model, the order process is…
Many centralized mechanisms for two-sided matching markets that enjoy strong theoretical properties assume that the planner solicits full information on the preferences of each participating agent. In particular, they expect that…
Recently, Atar and Miyazawa [2] introduced a multi-level GI/G/1 queue with a finite number of levels, where both the arrival and service rates depend on the level corresponding to the current queue length. For this model, they proved that…
We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize the existence of a connected strongly-proportional allocation…
Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical…
Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…
This paper investigates a partially observable queueing system with $N$ nodes in which each node has a dedicated arrival stream. There is an extra arrival stream to balance the load of the system by routing its customers to the shortest…
In this paper, we use a machine learning approach to predict the stationary distributions of the number of customers in a single-staiton multi server system. We consider two systems, the first is $c$ homogeneous servers, namely the…
Advertisement and propaganda have changed continuously in the past decades, mainly due to the people's interactions at online platforms and social networks, and operate nowadays reaching a highly specific online audience instead targeting…