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

Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)266-273
Number of pages8
JournalNetworks
Volume35
Issue number4
DOIs
Publication statusPublished - Jan 1 2000

Fingerprint

Directed graphs
Markov processes

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. / Nakata, Toshio; Imahayashi, Hiroshi; Yamashita, Masafumi.

In: Networks, Vol. 35, No. 4, 01.01.2000, p. 266-273.

Research output: Contribution to journalArticle

Nakata, Toshio ; Imahayashi, Hiroshi ; Yamashita, Masafumi. / A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. In: Networks. 2000 ; Vol. 35, No. 4. pp. 266-273.
@article{9398623200c241829f9b7fe222583b72,
title = "A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem",
abstract = "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.",
author = "Toshio Nakata and Hiroshi Imahayashi and Masafumi Yamashita",
year = "2000",
month = "1",
day = "1",
doi = "10.1002/1097-0037(200007)35:4<266::AID-NET5>3.0.CO;2-4",
language = "English",
volume = "35",
pages = "266--273",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

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

AU - Nakata, Toshio

AU - Imahayashi, Hiroshi

AU - Yamashita, Masafumi

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1002/1097-0037(200007)35:4<266::AID-NET5>3.0.CO;2-4

DO - 10.1002/1097-0037(200007)35:4<266::AID-NET5>3.0.CO;2-4

M3 - Article

AN - SCOPUS:0034216177

VL - 35

SP - 266

EP - 273

JO - Networks

JF - Networks

SN - 0028-3045

IS - 4

ER -