Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (2)

Search Parameters:
Keywords = dime literature

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
16 pages, 1947 KiB  
Article
Books to the Masses! An Investigation of Russian WWI ‘Dime Stories’
by Luca Cortesi
Literature 2023, 3(2), 201-216; https://doi.org/10.3390/literature3020014 - 8 Apr 2023
Viewed by 2451
Abstract
The impact of WWI on Russian society was immediately disruptive. This effect affected every sphere of social and cultural environs. Although previous research has established that WWI was a major topic of the cultural discourse of that time, the way in which WWI [...] Read more.
The impact of WWI on Russian society was immediately disruptive. This effect affected every sphere of social and cultural environs. Although previous research has established that WWI was a major topic of the cultural discourse of that time, the way in which WWI literature, and in particular consumer literature, contributed to the representation of war among the mass population deserves further research. By drawing a parallel with the phenomenon of the American dime novel, this study is grounded on the analysis of the style, content, structure, and even of the ‘mere’ appearance of some 1914–1916 ‘mass’ publications aimed at the broader public. The goal of this article, therefore, is to stimulate a consistent re-evaluation of this strand of ‘consumer’ war literature and to focus on its importance as a culturological tool to have a better understanding of the cultural environment of that time. Full article
Show Figures

Figure 1

60 pages, 8064 KiB  
Article
Interdependent Defense Games with Applications to Internet Security at the Level of Autonomous Systems
by Hau Chan, Michael Ceyko and Luis Ortiz
Games 2017, 8(1), 13; https://doi.org/10.3390/g8010013 - 16 Feb 2017
Cited by 7 | Viewed by 8630
Abstract
We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under deliberate external attacks. Our model builds upon interdependent security (IDS) games, a model [...] Read more.
We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under deliberate external attacks. Our model builds upon interdependent security (IDS) games, a model by Heal and Kunreuther that considers the source of the risk to be the result of a fixed randomized-strategy. We adapt IDS games to model the attacker’s deliberate behavior. We define the attacker’s pure-strategy space and utility function and derive appropriate cost functions for the defenders. We provide a complete characterization of mixed-strategy Nash equilibria (MSNE), and design a simple polynomial-time algorithm for computing all of them for an important subclass of IDD games. We also show that an efficient algorithm to determine whether some attacker’s strategy can be a part of an MSNE in an instance of IDD games is unlikely to exist. Yet, we provide a dynamic programming (DP) algorithm to compute an approximate MSNE when the graph/network structure of the game is a directed tree with a single source. We also show that the DP algorithm is a fully polynomial-time approximation scheme. In addition, we propose a generator of random instances of IDD games based on the real-world Internet-derived graph at the level of autonomous systems (≈27 K nodes and ≈100 K edges as measured in March 2010 by the DIMES project). We call such games Internet games. We introduce and empirically evaluate two heuristics from the literature on learning-in-games, best-response gradient dynamics (BRGD) and smooth best-response dynamics (SBRD), to compute an approximate MSNE in IDD games with arbitrary graph structures, such as randomly-generated instances of Internet games. In general, preliminary experiments applying our proposed heuristics are promising. Our experiments show that, while BRGD is a useful technique for the case of Internet games up to certain approximation level, SBRD is more efficient and provides better approximations than BRGD. Finally, we discuss several extensions, future work, and open problems. Full article
(This article belongs to the Special Issue Decision Making for Network Security and Privacy)
Show Figures

Figure 1

Back to TopTop