From wait-free to arbitrary concurrent solo executions in colorless distributed computing

Finally, the paper studies a link between the solvability of d-set agreement and (d,ϵ)-solo approximate agreement in asynchronous wait-free message-passing systems, which provides an insight on the “maximal partitioning” allowed to solve an approximate agreement task.