IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v47y2018i2d10.1007_s00182-018-0623-0.html
   My bibliography  Save this article

A note on the eternal dominating set problem

Author

Listed:
  • Stephen Finbow

    (St. Francis Xavier University)

  • Serge Gaspers

    (UNSW Sydney and Data61, CSIRO)

  • Margaret-Ellen Messinger

    (Mount Allison University)

  • Paul Ottaway

    (Capilano University)

Abstract

We consider the “all guards move” model for the eternal dominating set problem. A set of guards form a dominating set on a graph and at the beginning of each round, a vertex not in the dominating set is attacked. To defend against the attack, the guards move (each guard either passes or moves to a neighboring vertex) to form a dominating set that includes the attacked vertex. The minimum number of guards required to defend against any sequence of attacks is the “eternal domination number” of the graph. In 2005, it was conjectured [Goddard et al. (J. Combin. Math. Combin. Comput. 52:169–180, 2005)] there would be no advantage to allow multiple guards to occupy the same vertex during a round. We show this is, in fact, false. We also describe algorithms to determine the eternal domination number for both models for eternal domination and examine the related combinatorial game, which makes use of the reduced canonical form of games.

Suggested Citation

  • Stephen Finbow & Serge Gaspers & Margaret-Ellen Messinger & Paul Ottaway, 2018. "A note on the eternal dominating set problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(2), pages 543-555, May.
    • Handle: RePEc:spr:jogath:v:47:y:2018:i:2:d:10.1007_s00182-018-0623-0
    DOI: 10.1007/s00182-018-0623-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-018-0623-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-018-0623-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:47:y:2018:i:2:d:10.1007_s00182-018-0623-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.