메뉴 건너뛰기




Volumn 35, Issue 4, 2000, Pages 266-273

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

Author keywords

Distributed agreement; Graph theory; Local majority polling; Markov chains; Monopolies

Indexed keywords


EID: 0034216177     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200007)35:4<266::AID-NET5>3.0.CO;2-4     Document Type: Article
Times cited : (17)

References (11)
  • 5
    • 0013406992 scopus 로고    scopus 로고
    • Distributed probabilistic polling and applications to proportionate agreement
    • Prague, Czech Republic, July (to appear)
    • [5] Y. Hassin and D. Peleg, Distributed probabilistic polling and applications to proportionate agreement, Proc 26th Int Colloq on Automata, Languages, and Programming, Prague, Czech Republic, July 1999 (to appear).
    • (1999) Proc 26th Int Colloq on Automata, Languages, and Programming
    • Hassin, Y.1    Peleg, D.2
  • 9
    • 0001737419 scopus 로고    scopus 로고
    • Size bounds for dynamic monopolies
    • [9] D. Peleg, Size bounds for dynamic monopolies, Discr Appl Math 86 (1998), 263-273.
    • (1998) Discr Appl Math , vol.86 , pp. 263-273
    • Peleg, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.