相关论文: When to arrive at a queue with earliness, tardines…

We analyze the latency or sojourn time L(m,n) for the last customer in a batch of n customers to exit from the m-th queue in a tandem of m queues in the setting where the queues are in equilibrium before the batch of customers arrives at…

We analyze a boarding solution for a transport system in which the number of passengers allowed to enter a transport cabin is automatically controlled. Expressions charac- terizing the stochastic properties of the passenger queue length,…

Strategic customer behavior is strongly influenced by the level of information that is provided to customers. Hence, to optimize the design of queueing systems, many studies consider various versions of the same service model and compare…

In cost sharing games with delays, a set of agents jointly allocates a finite subset of resources. Each resource has a fixed cost that has to be shared by the players, and each agent has a nonshareable player-specific delay for each…

How to form groups in a mobility system that offers shared rides, and how to split the costs within the travellers of a group, are non-trivial tasks, as two objectives conflict: 1) minimising the total costs of the system, and 2) making…

We analyze a tandem network of polling queues with two product types and two stations. We assume that external arrivals to the network follow a Poisson process, and service times at each station are exponentially distributed. For this…

We consider a general polling model with $N$ stations. The stations are served exhaustively and in cyclic order. Once a station queue falls empty, the server does not immediately switch to the next station. Rather, it waits at the station…

Motivated by applications from gig economy and online marketplaces, we study a two-sided queueing system under joint pricing and matching controls. The queueing system is modeled by a bipartite graph, where the vertices represent customer…

The Hotelling-Downs model is a natural and appealing model for understanding strategic positioning by candidates in elections. In this model, voters are distributed on a line, representing their ideological position on an issue. Each…

We consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to…

Motivated by emerging resource allocation and data placement problems such as web caches and peer-to-peer systems, we consider and study a class of resource allocation problems over a network of agents (nodes). In this model, nodes can…

We consider the platoon matching problem for a set of trucks with the same origin, but different destinations. It is assumed that the vehicles benefit from traveling in a platoon for instance through reduced fuel consumption. The vehicles…

Recent research found that fairness plays a key role in customer satisfaction. Therefore, many manufacturing and services industries have become aware of the need to treat customers fairly. Still, there is a huge lack of models that enable…

We consider polling models in the sense of Takagi (MIT Press, 1986). In our case, the feature of the server is that it may be forced to wait idly for new messages at an empty queue instead of switching to the next station. We propose four…

Consider a first-come, first-served single server queue with an initial workload $x>0$ and customers who arrive according to an inhomogeneous Poisson process with rate function $\lambda:[0,\infty)\rightarrow[0,\lambda_h ]$ for some…

In the one-dimensional facility assignment problem, m facilities and n agents are positioned along the real line. Each agent will be assigned to a single facility to receive service. Each facility incurs a building cost, which is shared…

This paper studies a spatial competition game between two firms that sell a homogeneous good at some pre-determined fixed price. A population of consumers is spread out over the real line, and the two firms simultaneously choose location in…

We introduce a natural but seemingly yet unstudied generalization of the problem of scheduling jobs on a single machine so as to minimize the number of tardy jobs. Our generalization lies in simultaneously considering several instances of…

To perform a queuing analysis or design in a communications context, we need to estimate the values of the input parameters, specifically the mean of the arrival rate and service time. In this paper, we propose an approach for estimating…

The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…