the Table \[tab:osa\_two\_users\].

1.  The threshold ($y_{min}$) that resolves $(Y_1,Y_2)$ is always such that $Y_1 \leq y_{min} < Y_2$, i.e., OSA resolves contention by identifying a threshold between the user channel gains. The threshold is fed back to the users in ternary alphabet $(0,1,e)$. The lone user with a channel gain strictly greater than the threshold value fed back by the base station would learn about its successful contention resolution and the other users would refrain from transmitting any further in the slot.

2.  The feedback for a threshold $y_{min}$ is, in fact, the binary expansion of $y_{min}$ (when feedback $e$ and feedback $1$ is mapped to $1$ and feedback $0$ is mapped to $0$). The feedback $1$ is equivalent to feedback $e$ followed by an EoC (end of contention) in this case.

3.  The thresholds that resolve contention for OSA form a countable set with a valid probability distribution (the probabilities sum up to $1$).

4.  The average delay to resolve contention is equal to the average length of the feedback, which is a function of the probability distribution of the threshold random variable. The probability distribution is a function only of the contention resolution algorithm (for the i.i.d. 