Related papers: A new bound of concurrence
This paper studies a spatial competition game between two firms that sell a homogeneous good at some pre-determined fixed price. A population of consumers is spread out over the real line, and the two firms simultaneously choose location in…
We obtain some new inequalities of Chebyshev Type.
In this note, first we refine Mandl's inequality. Then, we consider the product $p_1p_2... p_n$ and we refine some known lower bounds for it, and we find some upper bounds for it by using Mandl's inequality and its refinement and the…
When introducing a novel product, a seller sets a price and decides how much information to provide to a buyer, who may incur a search cost to discover an outside option. The buyer knows the outside option distribution; the seller knows…
With the growing adoption of machine learning (ML) systems in areas like law enforcement, criminal justice, finance, hiring, and admissions, it is increasingly critical to guarantee the fairness of decisions assisted by ML. In this paper,…
Most modern systems strive to learn from interactions with users, and many engage in exploration: making potentially suboptimal choices for the sake of acquiring new information. We initiate a study of the interplay between exploration and…
In 2005 Li et al. gave a phi-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek. We claim that the…
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
We give necessary and sufficient conditions for the Chebyshev inequality to be an equality.
We present a novel multilabel/ranking algorithm working in partial information settings. The algorithm is based on 2nd-order descent methods, and relies on upper-confidence bounds to trade-off exploration and exploitation. We analyze this…
We investigate the possibility of an incentive-compatible (IC, a.k.a. strategy-proof) mechanism for the classification of agents in a network according to their reviews of each other. In the $ \alpha $-classification problem we are…
We present a new recommendation setting for picking out two items from a given set to be highlighted to a user, based on contextual input. These two items are presented to a user who chooses one of them, possibly stochastically, with a bias…
We study competition between firms that contract with consumers before the consumers fully learn their product preferences. In a Hotelling duopoly, firms screen consumers by offering menus of option contracts. We characterize the unique…
We shall provide in this paper good deal pricing bounds for contingent claims induced by the shortfall risk with some loss function. Assumptions we impose on loss functions and contingent claims are very mild. We prove that the upper and…
We introduce a model of competing agents in a prophet setting, where rewards arrive online, and decisions are made immediately and irrevocably. The rewards are unknown from the outset, but they are drawn from a known probability…
Let A and B be finite sets in a commutative group. We bound |A+hB| in terms of |A|, |A+B| and h. We provide a submultiplicative upper bound that improves on the existing bound of Imre Ruzsa by inserting a factor that decreases with h.
We survey recent developments on the Restriction conjecture.
We consider competitive algorithms for adaptive group testing problems. In the first part of the paper, we develop an algorithm with competitive constant c < 1.452 thus improving the up to now best known algorithms with constants…
In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determine which of the initial candidates are possible winners, given that a fixed number $k$ of new candidates will be added. We…