DeepAI AI Chat
Log In Sign Up

Non-Parametric Stochastic Sequential Assignment With Random Arrival Times

06/09/2021
by   Danial Dervovic, et al.
0

We consider a problem wherein jobs arrive at random times and assume random values. Upon each job arrival, the decision-maker must decide immediately whether or not to accept the job and gain the value on offer as a reward, with the constraint that they may only accept at most n jobs over some reference time period. The decision-maker only has access to M independent realisations of the job arrival process. We propose an algorithm, Non-Parametric Sequential Allocation (NPSA), for solving this problem. Moreover, we prove that the expected reward returned by the NPSA algorithm converges in probability to optimality as M grows large. We demonstrate the effectiveness of the algorithm empirically on synthetic data and on public fraud-detection datasets, from where the motivation for this work is derived.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/31/2023

On the Performance of Large Loss Systems with Adaptive Multiserver Jobs

In this paper, we study systems where each job or request can be split i...
10/01/2017

Asymptotic response time analysis for multi-task parallel jobs

The response time of jobs with multiple parallel tasks is a critical per...
01/19/2020

Dynamic Weighted Fairness with Minimal Disruptions

In this paper, we consider the following dynamic fair allocation problem...
11/23/2022

The Stochastic Arrival Problem

We study a new modification of the Arrival problem, which allows for nod...
09/19/2019

When Two is Worse Than One

This note is concerned with the impact on job latency of splitting a tok...
05/12/2022

An improved KTNS algorithm for the job sequencing and tool switching problem

We outline a new Max Pipe Construction Algorithm (MPCA) with the purpose...
02/04/2022

Learning a Discrete Set of Optimal Allocation Rules in Queueing Systems with Unknown Service Rates

We study learning-based admission control for a classical Erlang-B block...