Matches in SemOpenAlex for { <https://semopenalex.org/work/W563237868> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W563237868 abstract "In nite games are a strong model for analyzing dynamic networks that encounter continuous topological changes during operation. In this framework, the players represent the contrary forces which modify the network. In particular, this thesis deals with three di erent two-player games which focus on guaranteeing routing and connectivity properties in dynamic networks. In each model, one player has to establish the proper operation of the network, while the adversary produces failures and demands that occur during operation. In the rst part, we study sabotage games, which van Benthem introduced in 2002. In these games, a Runner traverses a graph and tries to reach a set of goal vertices, while a Blocker removes edges. We re ne this game in two ways; namely we consider a more general winning objective expressed in linear temporal logic, and we study the variant in which Blocker is replaced by a probabilistic player. We show that in both cases the problem to decide whether Runner wins remains Pspace-complete. In the second part, we develop a routing game in which a routing agent has to deliver packets to their destinations, while a demand agent continuously generates packets and blocks connections for a certain amount of time. We show general limitations for obtaining routing strategies but also point to algorithmic solutions. e results depend on both the desired routing property and the coarseness of the model. For certain scenarios we develop feasible routing algorithms, each of which guarantees a routing property against any behavior of the demand agent. In the third part, we introduce a connectivity game between a Constructor and a Destructor. While Destructor deletes nodes, Constructor can restore or even create new nodes under certain conditions. Also, we model information ow through the network by allowing Constructor to change labels of adjacent nodes. Constructor either has a reachability or a safety objective, i.e., Constructor has to either establish a connected network or guarantee that the network always stays connected. We show under what conditions the solvability of these games is decidable and, in this case, analyze the computational complexity. e results depend on the abilities of Constructor and di er for the reachability and the safety version." @default.
- W563237868 created "2016-06-24" @default.
- W563237868 creator A5020814539 @default.
- W563237868 creator A5068703009 @default.
- W563237868 date "2013-01-01" @default.
- W563237868 modified "2023-09-26" @default.
- W563237868 title "Games on dynamic networks : routing and connectivity" @default.
- W563237868 cites W3005289063 @default.
- W563237868 cites W2876980590 @default.
- W563237868 hasPublicationYear "2013" @default.
- W563237868 type Work @default.
- W563237868 sameAs 563237868 @default.
- W563237868 citedByCount "1" @default.
- W563237868 countsByYear W5632378682015 @default.
- W563237868 crossrefType "journal-article" @default.
- W563237868 hasAuthorship W563237868A5020814539 @default.
- W563237868 hasAuthorship W563237868A5068703009 @default.
- W563237868 hasConcept C111472728 @default.
- W563237868 hasConcept C138885662 @default.
- W563237868 hasConcept C154945302 @default.
- W563237868 hasConcept C158379750 @default.
- W563237868 hasConcept C189950617 @default.
- W563237868 hasConcept C31258907 @default.
- W563237868 hasConcept C41008148 @default.
- W563237868 hasConcept C49937458 @default.
- W563237868 hasConcept C74172769 @default.
- W563237868 hasConceptScore W563237868C111472728 @default.
- W563237868 hasConceptScore W563237868C138885662 @default.
- W563237868 hasConceptScore W563237868C154945302 @default.
- W563237868 hasConceptScore W563237868C158379750 @default.
- W563237868 hasConceptScore W563237868C189950617 @default.
- W563237868 hasConceptScore W563237868C31258907 @default.
- W563237868 hasConceptScore W563237868C41008148 @default.
- W563237868 hasConceptScore W563237868C49937458 @default.
- W563237868 hasConceptScore W563237868C74172769 @default.
- W563237868 hasLocation W5632378681 @default.
- W563237868 hasOpenAccess W563237868 @default.
- W563237868 hasPrimaryLocation W5632378681 @default.
- W563237868 hasRelatedWork W20337799 @default.
- W563237868 hasRelatedWork W2075343681 @default.
- W563237868 hasRelatedWork W2084572565 @default.
- W563237868 hasRelatedWork W23822168 @default.
- W563237868 hasRelatedWork W2397755051 @default.
- W563237868 hasRelatedWork W2465005511 @default.
- W563237868 hasRelatedWork W2883028508 @default.
- W563237868 hasRelatedWork W2922268212 @default.
- W563237868 hasRelatedWork W2953379898 @default.
- W563237868 hasRelatedWork W2964040031 @default.
- W563237868 hasRelatedWork W2964266219 @default.
- W563237868 hasRelatedWork W2991015165 @default.
- W563237868 hasRelatedWork W2995590401 @default.
- W563237868 hasRelatedWork W2996558664 @default.
- W563237868 hasRelatedWork W2997486285 @default.
- W563237868 hasRelatedWork W3020933340 @default.
- W563237868 hasRelatedWork W3082741476 @default.
- W563237868 hasRelatedWork W3102208778 @default.
- W563237868 hasRelatedWork W3139078772 @default.
- W563237868 hasRelatedWork W3157683549 @default.
- W563237868 isParatext "false" @default.
- W563237868 isRetracted "false" @default.
- W563237868 magId "563237868" @default.
- W563237868 workType "article" @default.