The triad counts of a graph G are the numbers of various distinct induced subgraphs of order 3. If G is an undirected graph, there are 4 triad counts, and if G is a digraph, there are 16 triad counts. A multigraph is a sequence G = (G,,. , G,) of graphs and digraphs defined on a common vertex set. The concept of triad counts is generalized to multigraphs with colored vertices, edges, and arcs. ...

Background The Dark Triad literature examining pro-social behaviours is minimal, with mixed results. Participants and procedure This study investigates the relationships between altruistic based on self-report data from 286 adults. Altruism was assessed using two scales: a general measure as well more recent scale measur-ing compassionate altruism towards family, friends, strangers. Results Mac...

In this paper we explore the relation between three areas: judgment aggregation, belief merging and social choice theory. Judgment aggregation studies how to aggregate individual judgments on logically interconnected propositions into a collective decision on the same propositions. When majority voting is applied to some propositions (the premises) it may however give a different outcome than m...

Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a new epistemic input. While most such possible world semantics rely on a single ordering, we investigate the use of an additional preference ordering—representing, for instance, the epistemic context the agent finds itsel...