Dynamic monopolies of constant size

Research output: Contribution to journalArticlepeer-review


The paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood, at the previous round. (All recolorings are done simultaneously.) We say that a set Wo of vertices is a dynamic monopoly or dynamo if starting the game with the vertices of Wo colored white, the entire system is white after a finite number of rounds. D. Peleg (1998, Discrete Appl. Math. 86, 262-273) asked how small a dynamic monopoly may be as a function of the number of vertices. We show that the answer is O(1).

Original languageEnglish
Pages (from-to)191-200
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Issue number2
StatePublished - 2001
Externally publishedYes


  • Dynamic monopolies
  • Fault handling in distributed systems
  • Graph
  • Majority process
  • Small coalition
  • Voting

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Dynamic monopolies of constant size'. Together they form a unique fingerprint.

Cite this