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

DOI<266::AID-NET5>3.0.CO;2-4 10.1002/1097-0037(200007)35:4<266::AID-NET5>3.0.CO;2-4zbMath0970.91013OpenAlexW1980047954MaRDI QIDQ4506267

Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita

Publication date: 23 October 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200007)35:4<266::aid-net5>3.0.co;2-4

zbMATH Keywords

Markov chainsgraph theorypollinglocal majoritydistributed agreementmonopolies

Mathematics Subject Classification ID

Voting theory (91B12) Other game-theoretic models (91A40) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Directed graphs (digraphs), tournaments (05C20)

Related Items

Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Reversible iterative graph processes ⋮ Irreversible conversion of graphs

Cites Work

• Size bounds for dynamic monopolies
• Unnamed Item