A Game Theoretic Approach to the Analysis of Dynamic Networks | Zendy

Frank G. Radmacher | Zendy; Wolfgang Thomas | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Game Theoretic Approach to the Analysis of Dynamic Networks

Author(s) -

Frank G. Radmacher,

Wolfgang Thomas

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.02.010

Subject(s) - computer science , decidability , model checking , distributed computing , theoretical computer science , dynamic network analysis , computer network

A model of dynamic networks is introduced which incorporates three kinds of network changes: deletion of nodes (by faults or sabotage), restoration of nodes (by actions of ''repair''), and creation of nodes (by actions that extend the network). The antagonism between the operations of deletion and restoration resp. creation is modelled by a game between the two agents ''Destructor'' and ''Constructor''. In this framework of dynamic model-checking, we consider as specifications (''winning conditions'' for Constructor) elementary requirements on connectivity of those networks which are reachable from some initial given network. We show some basic results on the (un-)decidability and hardness of dynamic model-checking problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research