Related papers: On the Monotonicity of Work Function in k-Server C…
The Donsker-Varadhan rate function for occupation-time fluctuations has been seen numerically to exhibit monotone return to stationary nonequilibrium [Phys. Rev. Lett. 107, 010601 (2011)]. That rate function is related to dynamical activity…
The generalized 2-server problem is an online optimization problem where a sequence of requests has to be served at minimal cost. Requests arrive one by one and need to be served instantly by at least one of two servers. We consider the…
A monotonicity property of Harnack inequality is proved for positive invariant harmonic functions in the unit ball.
Over the last two decades, submodular function maximization has been the workhorse of many discrete optimization problems in machine learning applications. Traditionally, the study of submodular functions was based on binary function…
We construct a version of kneading theory for families of monotonous functions on the real line. The generality of the setup covers two classical results from Milnor-Thurston's kneading theory: the first one is to dynamically characterise…
We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…
This is an outline of work in progress. We study the conjecture that the topological entropy of a real cubic map depends ``monotonely'' on its parameters, in the sense that each locus of constant entropy in parameter space is a connected…
The problem of online scheduling of multi-server jobs is considered, where there are a total of $K$ servers, and each job requires concurrent service from multiple servers for it to be processed. Each job on its arrival reveals its…
The Work Function Algorithm is the most effective deterministic on-line algorithm for the k-server problem. Koutsoupias and Papadimitriou proved WFA is (2k-1) competitive. However the best known implementation of WFA requires time O(i^2) to…
In this paper we prove some monotonicity, log--convexity and log--concavity properties for the Volterra and incomplete Volterra functions. Moreover, as consequences of these results, we present some functional inequalities (like Tur\'an…
We present a new method for proving Correa-Jofr\'e-Thibault theorem that monotonicity of subdifferential implies convexity of the function. This new method is based on barrier functions. Barrier functions help overcome some of the main…
We study the $k$-server problem in the resource augmentation setting i.e., when the performance of the online algorithm with $k$ servers is compared to the offline optimal solution with $h \leq k$ servers. The problem is very poorly…
We prove a few new lower bounds on the randomized competitive ratio for the $k$-server problem and other related problems, resolving some long-standing conjectures. In particular, for metrical task systems (MTS) we asympotically settle the…
In this paper, we investigate the monotonicity of the functions $t \mapsto \frac{\sum_{k=0}^\infty a_k w_k(t)}{\sum_{k=0}^\infty b_k w_k(t)}$ and $x \mapsto \frac{\int_\alpha^\beta f(t) w(t,x) \textrm{d} t}{\int_\alpha^\beta g(t) w(t,x)…
We offer an alternative and shorter proof to a result by Jan J.Ub{\o}e about monotonicity properties of a one-dimensional function that appeared in the Mathematical Intelligencer in 2015. Our proof is based on reducing the problem to…
The weighted $k$-server problem is a natural generalization of the $k$-server problem where each server has a different weight. We consider the problem on uniform metrics, which corresponds to a natural generalization of paging. Our main…
Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given performance to the orchestrater, usually in the form of contracts. These contracts…
Recent work in simultaneous machine translation is often trained with conventional full sentence translation corpora, leading to either excessive latency or necessity to anticipate as-yet-unarrived words, when dealing with a language pair…
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
A monotone function interval is the set of monotone functions that lie pointwise between two fixed monotone functions. We characterize the set of extreme points of monotone function intervals and apply this to a number of economic settings.…