English
Related papers

Related papers: Queue or lounge: strategic design for strategic cu…

200 papers

We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait…

Probability · Mathematics 2016-08-11 I. J. B. F. Adan , V. G. Kulkarni , N. Lee , A. A. J Lefeber

State-of-the-art reasoning LLMs are powerful problem solvers, but they still occasionally make mistakes. However, adopting AI models in risk-sensitive domains often requires error rates near 0%. To address this gap, we propose collaboration…

Artificial Intelligence · Computer Science 2025-07-22 Michael J. Zellinger , Matt Thomson

In this paper, we study queueing systems with delayed information that use a generalization of the multinomial logit choice model as its arrival process. Previous literature assumes that the functional form of the multinomial logit model is…

Dynamical Systems · Mathematics 2022-11-23 Philip Doldo , Jamol Pender

Real-world systems often involve some pool of users choosing between a set of services. With the increase in popularity of online learning algorithms, these services can now self-optimize, leveraging data collected on users to maximize some…

Machine Learning · Computer Science 2024-03-12 Eliot Shekhtman , Sarah Dean

A classical queuing theory result states that in a parallel-queue single-server model, the maximum stability region does not depend on the scheduling decision epochs, and in particular is the same for preemptive and non-preemptive systems.…

Probability · Mathematics 2024-03-28 Nahuel Soprano-Loto , Urtzi Ayesta , Matthieu Jonckheere , Ina Maria Verloop

We explore the problem of efficiently implementing shared data structures in an asynchronous computing environment. We start with a traditional FIFO queue, showing that full replication is possible with a delay of only a single round-trip…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-05 Samuel Baldwin , Cole Hausman , Mohamed Bakr , Edward Talmage

We consider a discrete population of users with homogeneous service demand who need to decide when to arrive to a system in which the service rate deteriorates linearly with the number of users in the system. The users have heterogeneous…

Computer Science and Game Theory · Computer Science 2016-05-30 Liron Ravner , Moshe Haviv , Hai L. Vu

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…

Computer Science and Game Theory · Computer Science 2024-07-10 Simon Krogmann , Pascal Lenzner , Alexander Skopalik , Marc Uetz , Marnix C. Vos

As a privacy-preserving paradigm for training Machine Learning (ML) models, Federated Learning (FL) has received tremendous attention from both industry and academia. In a typical FL scenario, clients exhibit significant heterogeneity in…

Machine Learning · Computer Science 2023-07-27 Lei Fu , Huanle Zhang , Ge Gao , Mi Zhang , Xin Liu

This paper studies a service system in which arriving customers are provided with information about the delay they will experience. Based on this information they decide to wait for service or to leave the system. Specifically, every…

Probability · Mathematics 2022-08-31 Yoshiaki Inoue , Liron Ravner , Michel Mandjes

A current trend in networking and cloud computing is to provide compute resources over widely dispersed places exemplified by initiatives like Network Function Virtualisation. This paves the way for a widespread service deployment and can…

Networking and Internet Architecture · Computer Science 2016-05-31 Matthias Keller , Holger Karl

The Load-Balanced Router architecture has received a lot of attention because it does not require centralized scheduling at the internal switch fabrics. In this paper we reexamine the architecture, motivated by its potential to turn off…

Networking and Internet Architecture · Computer Science 2013-01-04 Matthew Andrews , Lisa Zhang

These days enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly…

Performance · Computer Science 2015-12-16 Subrata Ashe

We study online task allocation for multi-robot, multi-queue systems with stochastic arrivals and switching delays. Time is slotted; each location can host at most one robot per slot; service consumes one slot; switching between locations…

Robotics · Computer Science 2025-10-01 Mohammad Merati , David Castañón

In this paper, we investigate the Mechanism Design aspects of the $m$-Capacitated Facility Location Problem ($m$-CFLP) on a line. We focus on two frameworks. In the first framework, the number of facilities is arbitrary, all facilities have…

Computer Science and Game Theory · Computer Science 2024-04-23 Gennaro Auricchio , Zihe Wang , Jie Zhang

We consider the problem of designing a packet-level congestion control and scheduling policy for datacenter networks. Current datacenter networks primarily inherit the principles that went into the design of Internet, where congestion…

Networking and Internet Architecture · Computer Science 2017-10-10 Devavrat Shah , Qiaomin Xie

The interest to retrial queueing systems is due to their application to telephone systems. The paper studies multiserver retrial queueing systems with $n$ servers. Arrival process is a quite general point process. An arriving customer…

Probability · Mathematics 2021-06-30 Vyacheslav M. Abramov

This paper studies the design of a service system in the presence of economies-of-scale. The goal is to make decision on the number, location, service capacities of facilities as well as on the allocation of customers to the opened…

Optimization and Control · Mathematics 2020-06-16 Pooya Hoseinpour

We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…

Probability · Mathematics 2017-11-28 Lam M. Nguyen , Alexander Stolyar

Booking control problems are sequential decision-making problems that occur in the domain of revenue management. More precisely, freight booking control focuses on the problem of deciding to accept or reject bookings: given a limited…

Optimization and Control · Mathematics 2023-04-06 Justin Dumouchelle , Emma Frejinger , Andrea Lodi