While the opportunity to punish selfish and reward generous behavior coexist in many instances in daily life, in most … laboratory studies, the demand for punishment and reward are studied separately from one another. This paper presents the results … from an experiment measuring the demand for reward and punishment by 'unaffected' third parties, separately and jointly. We …

The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n4) whether three given vertices of a graph … provide an O(nm)-time algorithm that given a triangle-free graph G together with four vertices outputs either an induced tree …

replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given … finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm … is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006). …