Mean-Field Games are games with a continuum of players that incorporate the time-dimension through a control-theoretic approach. Recently, simpler approaches relying on the Best Reply Strategy have been proposed. They assume that the agents navigate their strategies towards their goal by taking the direction of steepest descent of their cost function (i.e. the opposite of the utility function). In this paper, we explore the link between Mean-Field Games and the Best Reply Strategy approach. This is done by introducing a Model Predictive Control framework, which consists of setting the Mean-Field Game over a short time interval which recedes as time moves on. We show that the Model Predictive Control offers a compromise between a possibly unrealistic Mean-Field Game approach and the sub-optimal Best Reply Strategy.

No abstract uploaded!

An analogue of the well-known $$ \frac{3}{{16}} $$ lower bound for the first eigenvalue of the Laplacian for a congruence hyperbolic surface is proven for a congruence tower associated with any non-elementary subgroup$L$of SL(2,$Z$). The proof in the case that the Hausdorff of the limit set of$L$is bigger than $$ \frac{1}{2} $$ is based on a general result which allows one to transfer such bounds from a combinatorial version to this archimedian setting. In the case that delta is less than $$ \frac{1}{2} $$ we formulate and prove a somewhat weaker version of this phenomenon in terms of poles of the corresponding dynamical zeta function. These “spectral gaps” are then applied to sieving problems on orbits of such groups.

We study mixing properties of commutative groups of automorphisms acting on compact nilmanifolds. Assuming that every non-trivial element acts ergodically, we prove that such actions are mixing of all orders. We further show exponential 2-mixing and 3-mixing. As an application we prove smooth cocycle rigidity for higher-rank abelian groups of nilmanifold automorphisms.

No abstract uploaded!