Key points are not available for this paper at this time.
We study tractability properties of the weighted Lₚ-discrepancy. The concept of weighted discrepancy was introduced by Sloan and Wo\'z\-nia\-kowski in 1998 in order to prove a weighted version of the Koksma-Hlawka inequality for the error of quasi-Monte Carlo integration rules. The weights have the aim to model the influence of different coordinates of integrands on the error. A discrepancy is said to be tractable if the information complexity, i. e. , the minimal number N of points such that the discrepancy is less than the initial discrepancy times an error threshold, does not grow exponentially fast with the dimension. In this case there are various notions of tractabilities used in order to classify the exact rate. For even integer parameters p there are sufficient conditions on the weights available in literature, which guarantee the one or other notion of tractability. In the present paper we prove matching sufficient conditions (upper bounds) and neccessary conditions (lower bounds) for polynomial and weak tractability for all p (1, ). The proofs of the lower bounds are based on a general result for the information complexity of integration with positive quadrature formulas for tensor product spaces. In order to demonstrate this lower bound we consider as a second application the integration of tensor products of polynomials of degree at most 2.
Novak et al. (Tue,) studied this question.