Apologies, it has been a terrible while since I've last had to use probabilities, and I can not find the proper terminology for my question
I'll be using the marble bag analogy since it's the easiest for me. I want to maximize the probability of "A" and "C" of being selected.
Consider 3 lists or bags:
L1 = [A, B, B, B]
L2 = [C, C, D, D]
L3 = [E]
Consider 2 types of events:
Z1 is a pick from L1 and L3
Z2 is a pick from all 3 lists
With a limited amount X of event Z1 and limited amount Y of event Z2, in what order to use Z1 & Z2 to maximise the amount of A and C picked - and how to generalize this ? Will the order be different for different amounts of X & Y ?
How is this kind of problem named and where could I learn more? "multiple sets k-permutations" ?
Precision: The usecase here is without replacement: an element once selected is removed from their respective list. The event selection has equal probabilities for each element in its authorized lists, disregarding their list. Example: assuming Z1 is the very first event executed, it can with equal odds select an element in [A, B, B, B, E]. Assuming the very first Z1 randomly selects E, and we execute Z2 this time, Z2 will with equal odds select an element in [A, B, B, B, C, C, D, D].
Precision: What I'm precisely looking for is to understand the correct terminology here, and to maximize the selection of A and C elements (= successes). An ideal output would be: "For X=4 and Y=2, this combination maximize successes: [Z1, Z1, Z1, Z1, Z2, Z2] with in average P successes". And an understanding to generalize this for different X,Y, lists and events.