相关论文: Threshold Rules for the Classical Prophet Inequali…
A classical inequality, which is known for families of monotone functions, is generalized to a larger class of families of measurable functions. Moreover we characterize all the families of functions for which the equality holds. We apply…
It is common to model random errors in a classical measurement by the normal (Gaussian) distribution, because of the central limit theorem. In the quantum theory, the analogous hypothesis is that the matrix elements of the error in an…
This is supplementary material for the article arxiv:0708.3250. We provide an alternative introduction of the mean Euler Characteristic, additional examples and the percolation thresholds for 2-uniform lattices.
We estimate linear functionals in the classical deconvolution problem by kernel estimators. We obtain a uniform central limit theorem with $\sqrt{n}$-rate on the assumption that the smoothness of the functionals is larger than the…
A general framework is developed for separating classical and quantum correlations in a multipartite system. Entanglement is defined as the difference in the correlation information encoded by the state of a system and a suitably defined…
A central limit theorem is established for a sum of random variables belonging to a sequence of random fields. The fields are assumed to have zero mean conditional on the past history and to satisfy certain conditional $\alpha$-mixing…
Online contention resolution schemes (OCRSs) were proposed by Feldman, Svensson, and Zenklusen as a generic technique to round a fractional solution in the matroid polytope in an online fashion. It has found applications in several…
Classical entanglement is a powerful tool which provides a neat numerical estimate for the study of classical correlations. Its experimental investigation, however, has been limited to special cases. Here, we demonstrate that the…
Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…
Minimum error state discrimination between two mixed states \rho and \sigma can be aided by the receipt of "classical side information" specifying which states from some convex decompositions of \rho and \sigma apply in each run. We…
Bounds on the norm of quantum operators associated with classical Bell-type inequalities can be derived from their maximal eigenvalues. This quantitative method enables detailed predictions of the maximal violations of Bell-type…
We study generalizations of the "Prophet Inequality" and "Secretary Problem", where the algorithm is restricted to an arbitrary downward-closed set system. For {0,1}-values, we give O(log n)-competitive algorithms for both problems. This is…
The inconsistency of pairwise comparisons remains difficult to interpret in the absence of acceptability thresholds. The popular 10% cut-off rule proposed by Saaty has recently been applied to incomplete pairwise comparison matrices, which…
Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical…
Due to their numerous applications, in particular in Mechanism Design, Prophet Inequalities have experienced a surge of interest. They describe competitive ratios for basic stopping time problems where random variables get revealed…
Performative predictions are forecasts which influence the outcomes they aim to predict, undermining the existence of correct forecasts and standard methods of elicitation and estimation. We show that conditioning forecasts on covariates…
Most of the literature on online algorithms in revenue management focuses on settings with irrevocable decisions, where once a decision is made upon the arrival of a new input, it cannot be canceled later. Motivated by modern applications…
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we…
In this paper we consider the problem of estimating a parameter of a probability distribution when we have some prior information on a nuisance parameter. We start by the very simple case where we know perfectly the value of the nuisance…
A benevolent advisor observes a project's complexity and posts a pass - fail threshold before the agent chooses effort. The project succeeds only if ability and effort together clear complexity. We compare two informational regimes. In the…