Probabilistic local majority voting for the agreement problem on finite graphs

Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita

doi:10.1007/3-540-48686-0_33

Probabilistic local majority voting for the agreement problem on finite graphs

Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

21 Citations (Scopus)

Abstract

Motivated by the study of the deterministic local majority polling game by Peleg et al., this paper investigates a repetitive proba- bilistic local majority polling game on a finite connected graph by for- mulating 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).

Original language	English
Title of host publication	Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings
Editors	Shin-ichi Nakano, Hideki Imai, D.T. Lee, Takeshi Tokuyama, Takao Asano
Publisher	Springer Verlag
Pages	330-338
Number of pages	9
ISBN (Print)	3540662006, 9783540662006
DOIs	https://doi.org/10.1007/3-540-48686-0_33
Publication status	Published - Jan 1 1999
Event	5th Annual International Conference on Computing and Combinatorics, COCOON 1999 - Tokyo, Japan Duration: Jul 26 1999 → Jul 28 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1627
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th Annual International Conference on Computing and Combinatorics, COCOON 1999
Country/Territory	Japan
City	Tokyo
Period	7/26/99 → 7/28/99

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-48686-0_33

Cite this

Nakata, T., Imahayashi, H., & Yamashita, M. (1999). Probabilistic local majority voting for the agreement problem on finite graphs. In S. Nakano, H. Imai, D. T. Lee, T. Tokuyama, & T. Asano (Eds.), Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings (pp. 330-338). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1627). Springer Verlag. https://doi.org/10.1007/3-540-48686-0_33

Probabilistic local majority voting for the agreement problem on finite graphs. / Nakata, Toshio; Imahayashi, Hiroshi; Yamashita, Masafumi.

Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings. ed. / Shin-ichi Nakano; Hideki Imai; D.T. Lee; Takeshi Tokuyama; Takao Asano. Springer Verlag, 1999. p. 330-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1627).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nakata, T, Imahayashi, H & Yamashita, M 1999, Probabilistic local majority voting for the agreement problem on finite graphs. in S Nakano, H Imai, DT Lee, T Tokuyama & T Asano (eds), Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1627, Springer Verlag, pp. 330-338, 5th Annual International Conference on Computing and Combinatorics, COCOON 1999, Tokyo, Japan, 7/26/99. https://doi.org/10.1007/3-540-48686-0_33

Nakata T, Imahayashi H, Yamashita M. Probabilistic local majority voting for the agreement problem on finite graphs. In Nakano S, Imai H, Lee DT, Tokuyama T, Asano T, editors, Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings. Springer Verlag. 1999. p. 330-338. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48686-0_33

Nakata, Toshio ; Imahayashi, Hiroshi ; Yamashita, Masafumi. / Probabilistic local majority voting for the agreement problem on finite graphs. Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings. editor / Shin-ichi Nakano ; Hideki Imai ; D.T. Lee ; Takeshi Tokuyama ; Takao Asano. Springer Verlag, 1999. pp. 330-338 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0f85c258bbcb4cf6a66ffa795dafcf79,

title = "Probabilistic local majority voting for the agreement problem on finite graphs",

abstract = "Motivated by the study of the deterministic local majority polling game by Peleg et al., this paper investigates a repetitive proba- bilistic local majority polling game on a finite connected graph by for- mulating 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).",

author = "Toshio Nakata and Hiroshi Imahayashi and Masafumi Yamashita",

year = "1999",

month = jan,

day = "1",

doi = "10.1007/3-540-48686-0_33",

language = "English",

isbn = "3540662006",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "330--338",

editor = "Shin-ichi Nakano and Hideki Imai and D.T. Lee and Takeshi Tokuyama and Takao Asano",

booktitle = "Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings",

address = "Germany",

note = "5th Annual International Conference on Computing and Combinatorics, COCOON 1999 ; Conference date: 26-07-1999 Through 28-07-1999",

}

TY - GEN

T1 - Probabilistic local majority voting for the agreement problem on finite graphs

AU - Nakata, Toshio

AU - Imahayashi, Hiroshi

AU - Yamashita, Masafumi

PY - 1999/1/1

Y1 - 1999/1/1

N2 - Motivated by the study of the deterministic local majority polling game by Peleg et al., this paper investigates a repetitive proba- bilistic local majority polling game on a finite connected graph by for- mulating 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).

AB - Motivated by the study of the deterministic local majority polling game by Peleg et al., this paper investigates a repetitive proba- bilistic local majority polling game on a finite connected graph by for- mulating 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).

UR - http://www.scopus.com/inward/record.url?scp=84956869317&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84956869317&partnerID=8YFLogxK

U2 - 10.1007/3-540-48686-0_33

DO - 10.1007/3-540-48686-0_33

M3 - Conference contribution

AN - SCOPUS:84956869317

SN - 3540662006

SN - 9783540662006

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

SP - 330

EP - 338

BT - Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings

A2 - Nakano, Shin-ichi

A2 - Imai, Hideki

A2 - Lee, D.T.

A2 - Tokuyama, Takeshi

A2 - Asano, Takao

PB - Springer Verlag

T2 - 5th Annual International Conference on Computing and Combinatorics, COCOON 1999

Y2 - 26 July 1999 through 28 July 1999

ER -

Probabilistic local majority voting for the agreement problem on finite graphs

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this