Probabilistic local majority voting for the agreement problem on finite graphs

Authors:
Toshio Nakata;Hiroshi Imahayashi;Masafumi Yamashita
Affiliations:
Department of Information Education, Fukuoka University of Education, Fukuoka, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan;Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka, Japan
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 2
Cited 6

Size bounds for dynamic monopolies

Discrete Applied Mathematics
Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review

Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review

Distributed probabilistic polling and applications to proportionate agreement

Information and Computation
Local majorities, coalitions and monopolies in graphs: a review

Theoretical Computer Science
Max- and Min-Neighborhood Monopolies

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Majority Consensus and the Local Majority Rule

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Random walks, interacting particles, dynamic networks: randomness can be helpful

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Coalescing random walks and voting on graphs

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the study of the deterministic local majority polling game by Peleg et al., this paper investigates a repetitive probabilistic local majority polling game on a finite connected graph by formulating it as a Markov chain. We mainly investigate the probability that the system reaches a given absorbing state and characterize when the probability attains the maximum (and minimum).