|
|
|
|
|
by chaoxu
1962 days ago
|
|
How about the following process? Each person gets randomly assigned to one of the two groups, when one group is full, move the rest to the other group. Does this make sure every equal partition have the same probability of showing up? |
|
I'm not sure, but I wouldn't bet against it. But what is the value of having an exactly equal partition?
On second thought, the algorithm you describe processes people in a particular order, and it is much more likely to put two people who both occur near the end of the list into the same bucket than to put them in different buckets. So if that processing order is constant, the algorithm cannot produce every equal partition with equal probability.