-
Notifications
You must be signed in to change notification settings - Fork 3
Introduction
Let's assume you want to share a pie with N people and the size of slices should be randomly drawn while making sure that nobody gets favoured. The size of slices can be interpreted as weights. Each weight need to between 0 and 1 while all the N weights need to sum up to 1 because we have unfortunately only one cake.
We are looking for a way to sample weights randomly were all N weights are identically distributed. The distribution of cake slices is the same for every of the N people who decided to share the cake.
Mathematically speaking, we look for a linear combination of N alternatives. If we have two options A1 and A2, we are looking for two weights w1 and w2 to obtain:
f = w<sub>1</sub> * A<sub>1</sub> + w<sub>2</sub> * A<sub>2</sub>
where w1 is uniformly sampled between 0 and 1 and w2 is set to (1-w1).
With more options more complicated. As an example, we want to sample soil textures and have the three options (A1) sand content, (A2) silt, and (A3) clay content. The weight of each option are w1, w2, and w3. They need to sum up to 1. The order of weights should not matter, i.e. a high sand content should be as likely as a high clay or silt content. We hence want to uniformly sample from the sand-silt-clay classification diagram.
- one common approach strategy (references) is to sample the first weight
$w_1 \sim \mathcal{U}[0,1]$ . then sample the next weight in the remaining range$w_2 \sim \mathcal{U}[0,1-w_1]$ . The last weight is then set as the remainder$w_3 = 1-w_1-w_2$ to obtain a sum of 1. - This approach can be extended to any target constant
$c$ :
$w_1 \sim \mathcal{U}[0,c]$ ,$w_2 \sim \mathcal{U}[0,c-w_1]$ ,$w_3 = c-w_1-w_2$ - And can also be extended to
$N$ alternatives and weights:
$w_1 \sim \mathcal{U}[0,c]$ ,
$w_2 \sim \mathcal{U}[0,c-w_1]$ ,
$w_3 \sim \mathcal{U}[0,c-w_1-w_2]$ ,
$w_4 \sim \mathcal{U}[0,c-w_1-w_2-w_3]$ ,
$\ldots$
$w_N = c-w_1-w_2-\ldots-w_{N-1}$ - The problem is that the distribution functions of the weights are not identical, leading to the fact that the order of the alternatives matters (large values of the first alternative/weight are always more likely than the large weights of the last alternative). See Figure 1 Panels A-C.
- This in turn means for the soil texture example that the sand-silt-clay classification diagram is not sampled uniformly. See Figure 1 Panels D.
- We propose a sampling strategy to obtain N weights for N alternatives that are all identically distributed (see Figure 1 Panels E-G) leading to a uniform sampling of the full domain (See Figure 1 Panels H)
© 2019-2021 - PieShareDistribution - juliane.mai@uwaterloo.ca
Funded under IMPC project of Global Water Futures program.
Table of contents