Stabilization Time in Weighted Minority Processes

DOI10.4230/LIPIcs.STACS.2019.54OpenAlexW2963343094MaRDI QIDQ5090505

Pál András Papp, Roger Wattenhofer

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1902.01228

zbMATH Keywords

benevolent modelminority process

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic minority on graphs
• Unfriendly partitions of a graph
• Satisfactory graph partition, variants, and generalizations
• Algorithmic approach to the satisfactory graph partitioning problem
• The fashion game: network extension of matching pennies
• The satisfactory partition problem
• Anti-coordination Games and Stable Graph Colorings
• Convergence in (Social) Influence Networks
• Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
• On the Analysis of “Simple” 2D Stochastic Cellular Automata
• Algorithms and Computation
• Stochastic Flips on Two-letter Words
• SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS
• Computing and Combinatorics
• Every rayless graph has an unfriendly partition

This page was built for publication: Stabilization Time in Weighted Minority Processes