Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems

12/01/2017
by   Toshiya Itoh, et al.
0

For the multi-objective time series search problem, Hasegawa and Itoh [Proc. of WALCOM, LNCS 9627, 2016, pp.201-212] presented the best possible online algorithm balanced price policy BPP for any monotone function f: R^k → R and derived the exact values of the competitive ratio for several monotone functions. Specifically for the monotone function f(c_1,...,c_k)=(c_1,...,c_k)/k, Hasegawa and Itoh derived the exact value of the arithmetic mean component competitive ratio for k=2 but it is not known for any integer k ≥ 3. In this paper, we derive the exact values of the arithmetic mean component competitive ratio for k=3 and k=4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2020

A Note on Optimizing the Ratio of Monotone Supermodular Functions

We show that for the problem of minimizing (or maximizing) the ratio of ...
research
11/20/2017

XSAT of Exact Linear CNF Classes

It is shown that l-regularity implies k-uniformity in exact linear CNF f...
research
11/10/2017

Completely inapproximable monotone and antimonotone parameterized problems

We prove that weighted circuit satisfiability for monotone or antimonoto...
research
09/28/2022

On Computing Exact Means of Time Series Using the Move-Split-Merge Metric

Computing an accurate mean of a set of time series is a critical task in...
research
10/25/2018

On Policies for Single-leg Revenue Management with Limited Demand Information

In this paper we study the single-leg revenue management problem, with n...
research
11/20/2017

XSAT of Linear CNF Formulas

Open questions with respect to the computational complexity of linear CN...
research
08/12/2023

On the Isomorphic Means and Comparison Inequalities

Based on collection of bijections, variable and function are extended in...

Please sign up or login with your details

Forgot password? Click here to reset