Polynomial values modulo primes on average, and the large(r) sieve

In sieve theory, one is concerned with estimating the size of a sifted set, which avoids certain residue classes modulo many primes. For example, the problem of counting primes corresponds to the situation when the residue class 0 is removed for each prime in a suitable range. This talk will be concerned about what happens when a positive proportion of residue classes is removed for each prime, and especially when this proporition is more than a half. In doing so we will come across an algebraic question: given a polynomial f(x) in Z[x], what is the average size of the value set of f reduced modulo primes?