We present the axiom of weighted component fairness for the class of forest games, a generalization of component fairness introduced by Herings, Talman and van der Laan (2008) in order to characterize the average tree solution. Given a system of weights, component efficiency and weighted component fairness yield a unique allocation rule. We provide an analysis of the set of allocation rules gen...

In this paper I present an extended implementation of the Random ferns algorithm contained in the R package rFerns. It di ers from the original by the ability of consuming categorical and numerical attributes instead of only binary ones. Also, instead of using simple attribute subspace ensemble it employs bagging and thus produce error approximation and variable importance measure modelled afte...

Abstract Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory quasicrystals). Two their most striking features that they have low complexity (zero topological entropy) uniquely ergodic. Random a generalisation where the substituted image letter is determined by Markov process. In stark contrast to counterparts, subshif...