A coupled cell system is a network of dynamical systems, or ‘cells’, coupled together. Such systems can be represented schematically by a directed graph whose nodes correspond to cells and whose… (More)

Let M be a monoid (e.g. N, Z, or Z), and A an abelian group. A is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F : A −→ A that commutes with all shift… (More)

If X is a discrete abelian group and A a finite set, then a cellular automaton (CA) is a continuous map F : A −→ A that commutes with all X-shifts. If φ : A −→ R, then, for any a ∈ A, we define Σφ(a)… (More)

Judgement aggregation is a model of social choice in which the space of social alternatives is the set of consistent evaluations (‘views’) on a family of logically interconnected propositions, or… (More)

Which is the best, impartially most plausible consensus view to serve as the basis of democratic group decision when voters disagree? Assuming that the judgment aggregation problem can be framed as a… (More)

We introduce a two-stage ranking of multidimensional alternatives, including uncertain prospects as particular case, when these objects can be given a suitable matrix form. The first stage defines a… (More)

If M is a monoid, and A is an abelian group, then A is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F : A −→ A that commutes with all shift maps. If F is… (More)

Judgement aggregation is a model of social choice where the space of social alternatives is the set of consistent evaluations (‘views’) on a family of logically interconnected propositions, or… (More)

If A is a finite alphabet, U ⊂ Z, and μU is a probability measure on A that “looks like” the marginal projection of a stationary stochastic process on A D , then can we “extend” μU to such a process?… (More)