We consider a two-player zero-sum game given by a Markov chain over a finite set of states K and a family of zero-sum matrix games (Gk)kK. The sequence of states follows the Marko...
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
Neural or cortical fields are continuous assemblies of mesoscopic models, also called neural masses, of neural populations that are fundamental in the modeling of macroscopic parts...