Optimal Admission Control for Multiclass Queues with Time-Varying Arrival Rates via State Abstraction

by   Marc Rigter, et al.

We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by N identical servers. Each task has a price, which is a positive real number, and a class. Each class of task has a different price distribution and service rate, and arrives according to an inhomogenous Poisson process. The objective is to decide which tasks to accept so that the total price of tasks processed is maximised over a finite horizon. We formulate the problem as a discrete time Markov Decision Process (MDP) with a hybrid state space. We show that the optimal value function has a specific structure, which enables us to solve the hybrid MDP exactly. Moreover, we prove that as the time step is reduced, the discrete time solution approaches the optimal solution to the original continuous time problem. To improve the scalability of our approach to a greater number of task classes, we present an approximation based on state abstraction. We validate our approach on synthetic data, as well as a real financial fraud data set, which is the motivating application for this work.


page 1

page 2

page 3

page 4


Sampling for Data Freshness Optimization: Non-linear Age Functions

In this paper, we study how to take samples from an information source, ...

Sequential Fair Resource Allocation under a Markov Decision Process Framework

We study the sequential decision-making problem of allocating a limited ...

Structural Properties of Optimal Fidelity Selection Policies for Human-in-the-loop Queues

We study optimal fidelity selection for a human operator servicing a que...

Wireless energy and information transfer in networks with hybrid ARQ

In this paper, we consider a class of wireless powered communication dev...

State-Continuity Approximation of Markov Decision Processes via Finite Element Analysis for Autonomous System Planning

Motion planning under uncertainty for an autonomous system can be formul...

Stabilizing a Queue Subject to Action-Dependent Server Performance

We consider a discrete-time system comprising an unbounded queue that lo...

Switching Attention in Time-Varying Environments via Bayesian Inference of Abstractions

Motivated by the goal of endowing robots with a means for focusing atten...

Please sign up or login with your details

Forgot password? Click here to reset