Filters








139 Hits in 3.3 sec

The Complexity of Reachability in Randomized Sabotage Games [chapter]

Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
2010 Lecture Notes in Computer Science  
We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of "sabotage games".  ...  Extending work by Löding and Rohde (who showed PSpacecompleteness of this reachability problem), we consider the randomized case (a "game against nature") in which the deleted edges are chosen at random  ...  We also thank the anonymous referees for their valuable comments and suggestions in improving this paper.  ... 
doi:10.1007/978-3-642-11623-0_9 fatcat:e5xw6g3lgfax7em3kydx4nyami

Moving in a network under random failures: A complexity analysis

Dominik Klein, Frank G. Radmacher, Wolfgang Thomas
2012 Science of Computer Programming  
This PSpace-completeness establishes the same complexity as was known for the non-randomized sabotage games (by the work of Löding and Rohde), and it sharpens the PSpace-completeness of Papadimitriou's  ...  We introduce a randomized variant of a model called the "sabotage game", where an agent, called "Runner", and a probabilistic adversary, "Nature", act in alternation.  ...  We also thank the anonymous referees for their valuable comments and suggestions in improving this paper.  ... 
doi:10.1016/j.scico.2010.05.009 fatcat:gupasnb42rbp5irlljvdt6tnse

Quantitative Games under Failures

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault, Marc Herbstritt
2015 Foundations of Software Technology and Theoretical Computer Science  
Finally, we show that restricting the dynamics of the game also leads to better complexity.  ...  We propose an extension of the sabotage games in which the first player (Runner) traverses an arena with dynamic weights determined by the second player (Saboteur).  ...  Table 1 Complexity results for quantitative sabotage games.  ... 
doi:10.4230/lipics.fsttcs.2015.293 dblp:conf/fsttcs/BrihayeGHMPR15 fatcat:rog3ha3uhzgt7ciufgkjv6ni3a

Quantitative Games under Failures [article]

Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault
2015 arXiv   pre-print
Finally, we show that restricting the dynamics of the game also leads to better complexity.  ...  We propose an extension of the sabotage games in which the first player (Runner) traverses an arena with dynamic weights determined by the second player (Saboteur).  ...  We can finally establish the complexity of solving sabotage parity games. Proof of Theorem 16.  ... 
arXiv:1504.06744v2 fatcat:d2rri5b6xraw5ashmhwcoeoslm

Connectivity Games over Dynamic Networks

Sten Grüner, Frank G. Radmacher, Wolfgang Thomas
2011 Electronic Proceedings in Theoretical Computer Science  
We show under which conditions the solvability of the corresponding games for Constructor is decidable, and in this case obtain upper and lower complexity bounds, as well as algorithms derived from winning  ...  A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources.  ...  We thank a careful referee for his/her remarks on Lemma 3.3 and Lemma 4.6; they helped to clarify the arguments.  ... 
doi:10.4204/eptcs.54.10 fatcat:cakfz2npyrf2pbmzyne66aqvqa

Connectivity games over dynamic networks

Sten Grüner, Frank G. Radmacher, Wolfgang Thomas
2013 Theoretical Computer Science  
We show under which conditions the solvability of the corresponding games for Constructor is decidable, and in this case obtain upper and lower complexity bounds, as well as algorithms derived from winning  ...  A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources.  ...  We thank a careful referee for his/her remarks on Lemma 3.3 and Lemma 4.6; they helped to clarify the arguments.  ... 
doi:10.1016/j.tcs.2012.12.001 fatcat:vrk6xc6n65e75jzz43qacb5com

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061)

Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, Wolfgang Thomas, Marc Herbstritt
2015 Dagstuhl Reports  
The area of non-zero-sum games is addressed in a wide range of topics: multi-player games, partial-observation games, quantitative game models, and -as a special focus -connections with control engineering  ...  In this report, the program, research issues, and results of Dagstuhl Seminar 15061 "Non-Zero-Sum-Games and Control" are described.  ...  This talk will focus on verification of the existence of reachable deadlock states of a game.  ... 
doi:10.4230/dagrep.5.2.1 dblp:journals/dagstuhl-reports/ChatterjeeLMT15 fatcat:3g2k4ej7n5hczbe33yhxrh3h5a

Distributionally Robust Tuning of Anomaly Detectors in Cyber-Physical Systems with Stealthy Attacks [article]

Venkatraman Renganathan, Navid Hashemi, Justin Ruths, Tyler H. Summers
2019 arXiv   pre-print
Furthermore, we highlight an important trade-off between the worst-case false alarm rate and the potential impact of a stealthy attacker by efficiently computing an outer ellipsoidal bound for the attack-reachable  ...  In the design of anomaly detectors, it is common to assume Gaussian noise models to maintain tractability; however, this assumption can lead the actual false alarm rate to be significantly higher than  ...  In the context of attacks, it is possible for an attacker to modify the sensor outputs and effectively generate aggressive and strategic noise profiles to sabotage the operation of USA.  ... 
arXiv:1909.12506v1 fatcat:ejyk2pgvfrcazifhfemxwmoutq

Security in multiagent systems by policy randomization

Praveen Paruchuri, Milind Tambe, Fernando Ordóñez, Sarit Kraus
2006 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06  
Security in multiagent systems is commonly defined as the ability of the system to deal with intentional threats from other agents.  ...  Unfortunately, little attention has been paid to intentional randomization of agents' policies in single-agent or decentralized (PO)MDPs without significantly sacrificing rewards or breaking down coordination  ...  It is also supported by the United States Department of Homeland Security through Center for Risk and Economic Analysis of Terrorism Events (CREATE). Sarit Kraus is also affiliated with UMI-ACS.  ... 
doi:10.1145/1160633.1160681 dblp:conf/atal/ParuchuriTOK06 fatcat:yitcwdjfvjh7haf3fxxai72f6a

Securing interdependent assets

Yevgeniy Vorobeychik, Joshua Letchford
2014 Autonomous Agents and Multi-Agent Systems  
Stackelberg security game models have become among the leading practical game theoretic approaches to security, having seen actual deployment in the LAX Airport, the United States Federal Air Marshals  ...  Specifically, the model of interdependencies presented in Letchford and Vorobeychik (2012) is a highly restricted special case of the model we present in this paper.  ...  Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S.  ... 
doi:10.1007/s10458-014-9258-0 fatcat:sxg25lnfgrdv7oau46f3fhrixq

Interdiction Games on Markovian PERT Networks

Eli Gutin, Daniel Kuhn, Wolfram Wiesemann
2015 Management science  
In a stochastic interdiction game a proliferator aims to minimize the expected duration of a nuclear weapons development project, while an interdictor endeavors to maximize the project duration by delaying  ...  We then generalize the dynamic model to account for uncertainty in the outcomes of the interdiction actions.  ...  In the first one, Brown et al. (2005) study the computational complexity of different classes of project interdiction games.  ... 
doi:10.1287/mnsc.2014.1973 fatcat:zpaeczxw5zee3i7wvd2lm4wqu4

Toxicity v. toxicity: How Ethnography Can Inform Scalable Technical Solutions

JAMIE SHERMAN, ANNE PAGE MCCLARD
2020 Ethnographic Praxis in Industry Conference Proceedings  
While a number of scholars have studied online communities, research on games has been mostly focused on the business, experience, and content of gameplay.  ...  applications in the industrial settings.  ...  It's just random, there can be one game where one Singaporean hates Indians, whereas in the next game, they can be like, one more Singaporean who doesn't care at all and just wants to like play the game  ... 
doi:10.1111/epic.12037 fatcat:2zy7dqldtff7nhhevxo4nlohm4

Scalable Solutions of Markov Games for Smart-Grid Infrastructure Protection

Chris Y. T. Ma, David K. Y. Yau, Nageswara S. V. Rao
2013 IEEE Transactions on Smart Grid  
However, the computational complexity of such a game grows exponentially with the size of the infrastructure, making it impractical for smart grids of reasonable sizes.  ...  In this paper, we show that when the players' current interest is a subset of the states only and they are willing to accept small inaccuracies in the game solutions, many Markov game states can be pruned  ...  This is because computing the long-term rewards of actions in an interesting state will need to consider the potential effects of other reachable game states.  ... 
doi:10.1109/tsg.2012.2223243 fatcat:tlpcb455s5aqvhfokzpt4gnuii

Foundations and applications of artificial Intelligence for zero-day and multi-step attack detection

Pierre Parrend, Julio Navarro, Fabio Guigou, Aline Deruyver, Pierre Collet
2018 EURASIP Journal on Information Security  
This review proposes a comprehensive framework for addressing the challenge of characterising novel complex threats and relevant counter-measures.  ...  Two main approaches are developed in the artificial intelligence field to track these attacks: statistics and machine learning.  ...  , as well as Julie Thompson who helped with the corrections in the English language.  ... 
doi:10.1186/s13635-018-0074-y fatcat:6rtye37etbhgdocnycj3mw6z2u

Knowledge Discovery in Cryptocurrency Transactions: A Survey

Xiao Fan Liu, Xin-Jian Jiang, Si-Hao Liu, Chi Kong Tse
2021 IEEE Access  
In return, the transaction history faithfully records the whole spectrum of cryptocurrency user behaviors.  ...  Specifically, we classify the existing research into three aspects, i.e., transaction tracings and blockchain address linking, the analyses of collective user behaviors, and the study of individual user  ...  ACKNOWLEDGMENT The authors would like to thank the valuable discussions from Prof. Ron G. Chen, Prof. Xiao-Ke Xu, and Prof. Ye Wu.  ... 
doi:10.1109/access.2021.3062652 fatcat:6nlq3wv4kbg53leejeby4iyxty
« Previous Showing results 1 — 15 out of 139 results