Why can we consider Round$-$Robin the "fairness" algorithm? It ensures all processes have roughly the same wait times. On average, it results in lowest turnaround times. It mitigates non$-$deterministic scheduling. Starvation is reduced since all processes get an equal opportunity at the CPU It holds processes in idle and running status simultaneously