Internet gaming disorder as a formative construct : implications for conceptualization and measurement

Background. Some people have serious problems controlling their internet and video game use. The DSM-5 now includes a proposal for ‘Internet Gaming Disorder’ as a condition in need of further study. Various studies aim to validate the proposed diagnostic criteria for Internet Gaming Disorder and multiple new scales have been introduced that cover the suggested criteria. Approach. Using a structured approach, we demonstrate that Internet Gaming Disorder might be better interpreted as a formative construct, as opposed to the current practice of conceptualizing it as a reflective construct. Incorrectly approaching a formative construct as a reflective one causes serious problems in scale development including (a) incorrect reliance on item-to-total scale correlation to exclude items and incorrectly relying on indices of inter-item reliability that do not fit the measurement model (e.g., Cronbach’s α) (b) incorrect interpretation of composite or mean scores that assume all items are equal in contributing value to a sum score, and (c) biased estimation of model parameters in statistical models. Implications. We show that these issues are impacting current validation efforts through two recent examples. A reinterpretation of Internet Gaming Disorder as a formative construct has broad consequences for current validation efforts and provides opportunities to reanalyze existing data. We discuss three broad implications for current research: (1) Composite latent constructs should be defined and used in models, (2) Item exclusion and selection should not rely on item-to-total scale correlations, and (3) Existing definitions of Internet Gaming Disorder should be enriched further

Efficient structural symmetry breaking for constraint satisfaction problems

Symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various forms of value and variable interchangeability is tractable using dedicated search procedures or symmetry-breaking constraints that allow nogoods and their symmetrically equivalent solutions to be stored and checked efficiently

Accidental rightness

In this paper I argue that the disagreement between modern moral philosophers and (some) virtue ethicists about whether motive affects rightness is a result of conceptual disagreement, and that when they develop a theory of ‘right action,’ the two parties respond to two very different questions. Whereas virtue ethicists tend to use ‘right’ as interchangeable with ‘good’ or ‘virtuous’ and as implying moral praise, modern moral philosophers use it as roughly equivalent to ‘in accordance with moral obligation.’ One implication of this is that the possibility of an act being right by accident does not pose a problem for consequentialism or deontology. A further implication is that it reveals a shortcoming in virtue ethics, namely that it does not—yet needs to—present an account of moral obligation

The bearable lightness of being

How are philosophical questions about what kinds of things there are to be understood and how are they to be answered? This paper defends broadly Fregean answers to these questions. Ontological categories-such as object, property, and relation-are explained in terms of a prior logical categorization of expressions, as singular terms, predicates of varying degree and level, etc. Questions about what kinds of object, property, etc., there are are, on this approach, reduce to questions about truth and logical form: for example, the question whether there are numbers is the question whether there are true atomic statements in which expressions function as singular terms which, if they have reference at all, stand for numbers, and the question whether there are properties of a given type is a question about whether there are meaningful predicates of an appropriate degree and level. This approach is defended against the objection that it must be wrong because makes what there depend on us or our language. Some problems confronting the Fregean approach-including Frege's notorious paradox of the concept horse-are addressed. It is argued that the approach results in a modest and sober deflationary understanding of ontological commitments

First-Order Decomposition Trees

Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the propositional case, there exist formal structures, such as decomposition trees (dtrees), that represent such a decomposition and allow us to determine the complexity of inference a priori. However, there is currently no equivalent structure nor analogous complexity results for lifted inference. In this paper, we introduce FO-dtrees, which upgrade propositional dtrees to the first-order level. We show how these trees can characterize a lifted inference solution for a probabilistic logical model (in terms of a sequence of lifted operations), and make a theoretical analysis of the complexity of lifted inference in terms of the novel notion of lifted width for the tree

Networked buffering: a basic mechanism for distributed robustness in complex adaptive systems

A generic mechanism - networked buffering - is proposed for the generation of robust traits in complex systems. It requires two basic conditions to be satisfied: 1) agents are versatile enough to perform more than one single functional role within a system and 2) agents are degenerate, i.e. there exists partial overlap in the functional capabilities of agents. Given these prerequisites, degenerate systems can readily produce a distributed systemic response to local perturbations. Reciprocally, excess resources related to a single function can indirectly support multiple unrelated functions within a degenerate system. In models of genome:proteome mappings for which localized decision-making and modularity of genetic functions are assumed, we verify that such distributed compensatory effects cause enhanced robustness of system traits. The conditions needed for networked buffering to occur are neither demanding nor rare, supporting the conjecture that degeneracy may fundamentally underpin distributed robustness within several biotic and abiotic systems. For instance, networked buffering offers new insights into systems engineering and planning activities that occur under high uncertainty. It may also help explain recent developments in understanding the origins of resilience within complex ecosystems. \ud \u