The CANDECOMP algorithm for the PARAFAC analysis of n × m × p three-way arrays is adapted to handle arrays in which n > rnp more efficiently. For such arrays, the adapted algorithm needs less memory space to store the data during the iterations, and uses less com- putation time than the original CANDECOMP …

In an anonymous 4-person economic game, participants contributed more money to a common project (i.e., cooperated) when required to decide quickly than when forced to delay their decision (Rand, Greene & Nowak, 2012), a pattern consistent with the social heuristics hypothesis proposed by Rand and colleagues. …