Related papers: A new bound of concurrence
We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We…
In this paper we establish some new bounds for the companion of Ostrowski's inequality for the case when $f'\in L^1[a,b]$, $f"\in L^2[a,b]$ and $f'\in L^2[a,b]$, respectively. We point out that the results in the first and third cases are…
We study how increasing competition, by making prizes more unequal, affects effort in contests. In a finite type-space environment, we characterize the equilibrium, analyze the effect of competition under linear costs, and identify…
An important issue in concurrency is interference. This issue manifests itself in both shared-variable and communication-based concurrency --- this paper focusses on the former case where interference is caused by the environment of a…
The main goal of this paper is to present new bounds for certain inner products in Hilbert spaces, with applications to the numerical radius and the operator norm. The obtained results significantly improve earlier results in this…
We address the problem of learning-augmented online caching in the scenario when each request is accompanied by a prediction of the next occurrence of the requested page. We improve currently known bounds on the competitive ratio of the…
In this paper, new upper and lower bounds for the Trapezoid inequality of absolutely continuous functions are obtained. Applications to some special means are provided as well.
We provide new lower bounds on the regret that must be suffered by adversarial bandit algorithms. The new results show that recent upper bounds that either (a) hold with high-probability or (b) depend on the total lossof the best arm or (c)…
We introduce a minimal evolutionary model to show how local cooperation and global competition can create a transition to the diversity of communities such as linguistic groups. By using a lattice model with high-dimensional state agents…
We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea is to consider non-uniform probability measures.
In this model study of the commodity market, we present some evidence of competition of commodities for the status of money in the regime of parameters, where emergence of money is possible. The competition reveals itself as a rivalry of a…
We present new bounds for the Berezin number inequalities which improve on the existing bounds. We also obtain bounds for the Berezin norm of operators as well as the sum of two operators.
We propose improved fixed-design confidence bounds for the linear logistic model. Our bounds significantly improve upon the state-of-the-art bound by Li et al. (2017) via recent developments of the self-concordant analysis of the logistic…
We consider the Ordered Open End Bin Packing problem. Items of sizes in $(0,1]$ are presented one by one, to be assigned to bins in this order. An item can be assigned to any bin for which the current total size strictly below $1$. This…
We propose a new model for the level I of a Limit Order Book (LOB), which incorporates the information about the standing orders at the opposite side of the book after each price change and the arrivals of new orders within the spread. Our…
We consider a monopoly seller who optimally auctions a single object to a single potential buyer, with a known distribution of valuations. We show that a tight lower bound on the seller's expected revenue is $1/e$ times the geometric…
We consider the problem of bidding in online advertising, where an advertiser aims to maximize value while adhering to budget and Return-on-Spend (RoS) constraints. Unlike prior work that assumes knowledge of the value generated by winning…
We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$
Clustering is a fundamental unsupervised learning problem where a dataset is partitioned into clusters that consist of nearby points in a metric space. A recent variant, fair clustering, associates a color with each point representing its…
Entanglement and coherence are two essential quantum resources for quantum information processing. A natural question arises of whether there are direct link between them. And by thinking about this question, we propose a new measure for…