Related papers: On the Monotonicity of Work Function in k-Server C…
The $k$-server conjecture, first posed by Manasse, McGeoch and Sleator in 1988, states that a $k$-competitive deterministic algorithm for the $k$-server problem exists. It is conjectured that the work function algorithm (WFA) achieves this…
We consider the Work Function Algorithm for the k-server problem. We show that if the Work Function Algorithm is c-competitive, then it is also strictly (2c)-competitive. As a consequence of [Koutsoupias and Papadimitriou, JACM 1995] this…
The deterministic $k$-server conjecture states that there is a $k$-competitive deterministic algorithm for the $k$-server problem for any metric space. We show that the work function algorithm is $3$-competitive for the $3$-server problem…
We propose a notion of operator monotonicity for functions of several variables, which extends the well known notion of operator monotonicity for functions of only one variable. The notion is chosen such that a fundamental relationship…
This note contains some observations on primary matrix functions and different notions of monotonicity with relevance towards constitutive relations in nonlinear elasticity. Focussing on primary matrix functions on the set of symmetric…
Although largely unnoticed by the online algorithms community, T-theory, a field of discrete mathematics, has contributed to the development of several online algorithms for the k-server problem. A brief summary of the k-server problem, and…
A Boolean $k$-monotone function defined over a finite poset domain ${\cal D}$ alternates between the values $0$ and $1$ at most $k$ times on any ascending chain in ${\cal D}$. Therefore, $k$-monotone functions are natural generalizations of…
In this paper, we investigate the complete monotonicity of some functions involving gamma function. Using the monotonic properties of these functions, we derived some inequalities involving gamma and beta functions. Such inequalities…
In this paper, we prove logarithmically complete monotonicity properties of certain ratios of the $k$-gamma function. As a consequence, we deduce some inequalities involving the $k$-gamma and $k$-trigamma functions.
The article considers the generalized k-Bessel functions and represents it as Wright functions. Then we study the monotonicity properties of the ratio of two different orders k- Bessel functions, and the ratio of the k-Bessel and the…
Learning performance can show non-monotonic behavior. That is, more data does not necessarily lead to better models, even on average. We propose three algorithms that take a supervised learning model and make it perform more monotone. We…
We prove a conjecture of Cuttler et al.~[2011] [A. Cuttler, C. Greene, and M. Skandera; \emph{Inequalities for symmetric means}. European J. Combinatorics, 32(2011), 745--761] on the monotonicity of \emph{normalized Schur functions} under…
In this paper, by using a general result on the monotonicity of quotients of power series, our aim is to prove some monotonicity and convexity results for the modified Struve functions. Moreover, as consequences of the above mentioned…
In many practical applications, heuristic or approximation algorithms are used to efficiently solve the task at hand. However their solutions frequently do not satisfy natural monotonicity properties of optimal solutions. In this work we…
A general divergence measure for monotonic functions is introduced. Its connections with the f-divergence for convex functions are explored. The main properties are pointed out.
In the preprint of 1993 the author formulated some conjectures on monotonicity of ratios for exponential series remainders. They are equivalent to conjectures on monotonicity of a ratio of Kummer hypergeometric functions and presumably not…
We provide an example of a monotone Boolean function on the hypercube given by a low depth decision tree that is not well approximated by any k-junta for small k.
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
We study the fundamental online k-server problem in a learning-augmented setting. While in the traditional online model, an algorithm has no information about the request sequence, we assume that there is given some advice (e.g.…
In this paper, the authors establish some inequalities involving the Psi and $k$-Gamma functions. The procedure utilizes some monotonicity properties of some functions associated with the Psi and $k$-Gamma functions.