Sequential Resource Access: Theory and Algorithm

12/07/2020
by   Lin Chen, et al.
0

We formulate and analyze a generic sequential resource access problem arising in a variety of engineering fields, where a user disposes a number of heterogeneous computing, communication, or storage resources, each characterized by the probability of successfully executing the user's task and the related access delay and cost, and seeks an optimal access strategy to maximize her utility within a given time horizon, defined as the expected reward minus the access cost. We develop an algorithmic framework on the (near-)optimal sequential resource access strategy. We first prove that the problem of finding an optimal strategy is NP-hard in general. Given the hardness result, we present a greedy strategy implementable in linear time, and establish the closed-form sufficient condition for its optimality. We then develop a series of polynomial-time approximation algorithms achieving (ϵ,δ)-optimality, with the key component being a pruning process eliminating dominated strategies and, thus maintaining polynomial time and space overhead.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2017

Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach

The experimental design problem concerns the selection of k points from ...
research
04/28/2018

New algorithms for Steiner tree reoptimization

Reoptimization is a setting in which we are given an (near) optimal sol...
research
12/17/2019

Optimal Perimeter Guarding with Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms

We perform structural and algorithmic studies of significantly generaliz...
research
03/27/2013

Computationally-Optimal Real-Resource Strategies

This paper focuses on managing the cost of deliberation before action. I...
research
12/07/2022

Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond

We study the problem of finding elements in the intersection of an arbit...
research
05/18/2023

Prophet Secretary Against the Online Optimal

We study the prophet secretary problem, a well-studied variant of the cl...
research
09/14/2018

Defending Elections Against Malicious Spread of Misinformation

The integrity of democratic elections depends on voters' access to accur...

Please sign up or login with your details

Forgot password? Click here to reset