skip to main content
10.1145/1073814.1073875acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
Article

Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers

Published: 17 July 2005 Publication History

Abstract

No abstract available.

References

[1]
J. Beauquier, M. Gradinariu and C. Johnen. Memory Space Requirements for Self-Stabilizing Leader Election Protocols. PODC'99, pages 199--208, 1999.
[2]
R. Bubley and M. Dyer. Path coupling: A technique for proving rapid mixing in Markov chains. In FOCS'97, pages 223--231, 1997.
[3]
A. Czumaj and M. Kutylowski. Delayed path coupling and generating random permutations. Random Structures and Algorithms, 17(3-4):228--259, 2000.
[4]
M. Dyer, L.A. Goldberg, C. Greenhill, M. Jerrum, and M. Mitzenmacher. An extension of path coupling and its application to the Glauber dynamics for graph colorings. SIAM J. Comput., 30(6):1962--1975, 2002.
[5]
L. Fribourg, S. Messika, and C. Picaronny. Coupling and Self-stabilization. In DISC 2004, LNCS 3274, pages 201--215. Springer, 2004.
[6]
T.P. Hayes and E. Vigoda. Variable Length Path Coupling. SODA 2004, pages 103--110. SIAM, 2004.

Cited By

View all
  • (2012)Adversarial scheduling in discrete models of social dynamicsMathematical Structures in Computer Science10.1017/S096012951100053322:5(788-815)Online publication date: 1-Sep-2012
  • (2011)Self-Stabilization in Energy-Constraint Wireless Ad Hoc NetworksProceedings of the 2011 Tenth International Symposium on Autonomous Decentralized Systems10.1109/ISADS.2011.67(462-468)Online publication date: 23-Mar-2011
  • (2006)All k-bounded policies are equivalent for self-stabilizationProceedings of the 8th international conference on Stabilization, safety, and security of distributed systems10.5555/1759076.1759084(82-94)Online publication date: 17-Nov-2006
  • Show More Cited By

Index Terms

  1. Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
    July 2005
    364 pages
    ISBN:1581139942
    DOI:10.1145/1073814
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 17 July 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. correctness
    2. fault tolerance
    3. randomized distributed algorithms
    4. rates of convergence
    5. verification

    Qualifiers

    • Article

    Conference

    PODC05

    Acceptance Rates

    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 02 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2012)Adversarial scheduling in discrete models of social dynamicsMathematical Structures in Computer Science10.1017/S096012951100053322:5(788-815)Online publication date: 1-Sep-2012
    • (2011)Self-Stabilization in Energy-Constraint Wireless Ad Hoc NetworksProceedings of the 2011 Tenth International Symposium on Autonomous Decentralized Systems10.1109/ISADS.2011.67(462-468)Online publication date: 23-Mar-2011
    • (2006)All k-bounded policies are equivalent for self-stabilizationProceedings of the 8th international conference on Stabilization, safety, and security of distributed systems10.5555/1759076.1759084(82-94)Online publication date: 17-Nov-2006
    • (2006)All k-Bounded Policies Are Equivalent for Self-stabilizationStabilization, Safety, and Security of Distributed Systems10.1007/978-3-540-49823-0_6(82-94)Online publication date: 2006

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media