Posts classified under: Amacc

Coalition formation is a cooperative game theory framework in which a set of agents, required to perform implicit or explicit tasks, must be divided into subgroups (called coalitions), according to collective criteria and a utility function describing the utility of each coalition. This is equivalent to a problem of partitioning the set of agents. The … Continue reading Séminaire Algorithmique : Josselin Guéneron (GREYC) « Repeated Stochastic Coalition Formation: representations and algorithmic approaches »

In 1964, R. Berger proved the existence of strongly aperiodic subshifts of finite type (SFT) on $\mathbb{Z}^2$, and used them to prove the undecidability of the Domino Problem. With the goal of understanding what aspects of $\mathbb{Z}^2$ account for this result, there has been an effort in recent years to characterize the groups with undecidable … Continue reading Séminaire Algorithmique : Nicolas Bitar (LAMFA, Univ. Picardie), « Subshifts of finite type and quasi-isometries beyond groups »