Majority consensus and the local majority rule

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 530-542

  Mustafa, Nabil H ^a   Pekeč, Aleksandar ^b  

^a Duke University   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; AUTOMATA THEORY;

ARCHITECTURE OF NETWORKS; INITIAL STATE; LOCAL COMPUTATION; LOCAL MAJORITY RULES; LOCAL NETWORKS; NETWORK OF AGENTS; COMPUTATION PROBLEMS;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

EID: 84879513212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_44     Document Type: Conference Paper

References (21)

1. E. Berger. Dynamic monopolies of constant size. Manuscript, http://xxx. lanl. gov/abs/math/9911125, 1999.
2. F. Flocchini, E. Lodi, F. Luccio, L. Pagli, and N. Santoro. Monotone dynamos in tori. In Proc. 6th International Colloqium on Structural Information and Communication Complexity, pages 152-165, 1999.
3. P. Flocchini, E. Lodi, F. Luccio, and N. Santoro. Irreversible dynamos in tori. In European Conference on Parallel Processing, pages 554-562, 1998.
4. E. Goles and S. Martinez. Neural and Automata Networks. Kluwer, Norwell MA, 1990.
5. E. Goles and J. Olivos. Periodic behavior of generalized threshold functions. Discrete Mathematics, 30:187-189, 1980.
6. E. Goles and J. Olivos. Comportement p'eriodique des fonctions 'a seuil binaires et applications. Discrete Applied Mathematics, 3:93-105, 1981.
7. E. Goles. Positive automata networks, pages 101-112. Disordered Systems and Biological Organization. Springer-Verlag, 1986.
8. Y. Hassin. Probabilistic local polling processes in graphs. M. Sc. Thesis, The Weizmann Institute, Rehovot, Israel, 1998.
9. Y. Hassin and D. Peleg. Distributed probabilistic polling and applications to proportionate agreement. In Proc. 26th International Colloqium on Automata, Languages, and Programming, pages 402-411, 1999.
10. Y. Hassin and D. Peleg. Extremal bounds for probabilistic polling in graphs. In Proc. 7th International Colloqium on Structural Information and Communication Complexity, 2000.
11. F. Luccio, L. Pagli, and H. Sanossian. Irreversible dynamos in butterflies. In Proc. 6th International Colloqium on Structural Information and Communication Complexity, pages 204-218, 1999.
12. G. Moran. Parametrization for stationary patterns of the r-majority operators on 0-1 sequences. Discrete Mathematics, 132:175-195, 1994.
13. G. Moran. The r-majority vote action on 0-1 sequences. Discrete Mathematics, 132:145-174, 1994.
14. G. Moran. On the period-two-property of the majority operator in infinite graphs. Trans. Amer. Math. Soc. , 347(5):1649-1667, 1995.
15. N. H. Mustafa and A. Pekec. Democratic consensus and the local majority rule. Research Series RS-00-08, BRICS, University of Aarhus, Denmark, 2000.
16. T. Nakata, H. Imahayashi, and M. Yamashita. Probabilistic local majority voting for the agreement problem on finite graphs. In Proc. 5th Computing and Combinatorics Conference, pages 330-338, 1999.
17. T. Nakata, H. Imahayashi, and M. Yamashita. A probabilistic local polling game on weighted directed graphs with an application to the distributed agreement problem. Networks, 35(4):266-273, 2000.
18. D. Peleg. Size bounds for dynamic monopolies. Discrete Applied Mathematics, 86:263-273, 1998.
19. S. Poljak and M. Sura. On periodical behaviour in societies with symmetric influences. Combinatorica, 3(1):119-121, 1983.
20. S. Poljak and D. Turzik. On an application of convexity to discrete systems. Discrete Applied Mathematics, 13:27-32, 1986.
21. S. Poljak and D. Turzik. On pre-periods of discrete influence systems. Discrete Applied Mathematics, 13:33-39, 1986.