Based on a series of vignette studies, DeScioli et al. (2011) proposed that omission bias, i.e., the preference for harm caused by omissions over commissions even when outcome is same, may be occurred as produces little public evidence wrongdoing. In this study, effects identified were examined using an opt-in policy organ donation in Japan. The results revealed context donating organs was not ...

Laissez-faire leadership has received much less attention than have the 3 transactional leadership dimensions of the Multifactor Leadership Questionnaire (MLQ). However, laissez-faire leadership has shown strong negative relationships with various leadership criteria, and the absence of leadership (laissez-faire leadership) may be just as important as is the presence of other types of leadershi...

We point out an omission in the paper ‘The Algebraic Structure of the Arbitrary-Order Cone’ by Alzalg published in J. Optim. Theory Appl. in 2016. In reaction to this omission, some alternative results have been presented.

The k-set agreement problem is a paradigm of coordination problems encountered in distributed computing. The parameter k defines the coordination degree we are interested in. The case k corresponds to the well-known uniform consensus problem. More precisely, the k-set agreement problem considers a system made up of n processes where each process proposes a value. It requires that each non-fault...

Abstract The counterfactual comparative account of harm ( cca ) faces well-known problems concerning preemption and omission. In a recent article in this journal, Daniel Immerman proposes novel variant , which he calls the worse than nothing wtna ). According to Immerman, nicely handles omission problems. We seek show, however, that is not an acceptable harm. particular, while deals better with...

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy. We describe a technique to automatically transform protocols devised in the perfectly-synchronized round-based model into protocols for the crash, send omission, general omission or Byzantine...