We study the weighted star discrepancy of digital nets and sequences. Product weights and finite-order weights are considered
and we prove tractability bounds for Niederreiter and Faure-Niederreiter sequences. Further we prove an existence result for
digital nets achieving a strong tractability error bound by calculating the average over all generator matrices.
The first author is supported by the Australian Research Council under its Center of Excellence Program.
The third author is supported by the Austrian Science Fund (FWF), Project S8305 and Project P17022-N12.