Combinatorial batch codes: Extremal problems under Hall-type conditions

We study set (multi)systems F of size n over an m-element underlying set, such that for any at most k members of F a system of representatives can be chosen in which each element represents at most t selected members. The purpose is to minimize the total size ∑ F ∈ F | F | for given parameters n, k, m, t.