@inproceedings{67bc2a4885214d50ba77e5ba268a3bbe,

title = "Game-Theoretic Approach to Self-stabilizing Minimal Independent Dominating Sets",

abstract = "An independent dominating set (IDS) is a set of vertices in a graph that ensures both independence and domination. The former property asserts that no vertices in the set are adjacent to each other while the latter demands that every vertex not in the set is adjacent to at least one vertex in the IDS. We extended two prior game designs, one for independent set and the other for dominating set, to three IDS game designs where players independently determine whether they should be in or out of the set based on their own interests. Regardless of the game play sequence, the result is a minimal IDS (i.e., no proper subset of the result is also an IDS). We turned the designs into three self-stabilizing distributed algorithms that always end up with an IDS regardless of the initial configurations. Simulation results show that all the game designs produce relatively small IDSs with reasonable convergence rate in representative network topologies.",

keywords = "Distributed algorithm, Game theory, Independent dominating set, Self-stabilization",

author = "Li-Hsing Yen and Sun, {Guang Hong}",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-030-02738-4_15",

language = "English",

isbn = "9783030027377",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "173--184",

editor = "Antonio Guerrieri and Jung, {Jason J.} and Giancarlo Fortino and Jingtao Sun and Yang Xiang",

booktitle = "Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings",

address = "Germany",

note = "null ; Conference date: 11-10-2018 Through 13-10-2018",

}