A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem

Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita

研究成果: Contribution to journalArticle査読

7 被引用数 (Scopus)

抄録

In this paper, we investigate a probabilistic local majority polling game on weighted directed graphs, keeping an application to the distributed agreement problem in mind. We formulate the game as a Markov chain, where an absorbing state corresponds to a system configuration that an agreement is achieved, and characterize on which graphs the game will eventually reach an absorbing state with probability 1. We then calculate, given a pair of an initial and an absorbing states, the absorbing probability that the game will reach the absorbing state, starting with the initial state. We finally demonstrate that regular graphs have a desirable property from the view of the distributed agreement application, by using the martingale theory.

本文言語英語
ページ(範囲)266-273
ページ数8
ジャーナルNetworks
35
4
DOI
出版ステータス出版済み - 7 2000

All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • 情報システム
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信

フィンガープリント

「A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル