A graph construction proves Ω(n^{2-ε}) stabilization time for minority processes for any ε>0, holding even under benevolent sequential and concurrent scheduling.
Stabilization time in weighted minority processes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Stabilization Time in Minority Processes
A graph construction proves Ω(n^{2-ε}) stabilization time for minority processes for any ε>0, holding even under benevolent sequential and concurrent scheduling.