Large deviations and Stochastic stability in Population Games

<p style='text-indent:20px;'>In this article we review a model of stochastic evolution under general noisy best-response protocols, allowing the probabilities of suboptimal choices to depend on their payoff consequences. We survey the methods developed by the authors which allow for a quantitative analysis of these stochastic evolutionary game dynamics. We start with a compact survey of techniques designed to study the long run behavior in the small noise double limit (SNDL). In this regime we let the noise level in agents' decision rules to approach zero, and then the population size is formally taken to infinity. This iterated limit strategy yields a family of deterministic optimal control problems which admit an explicit analysis in many instances. We then move in by describing the main steps to analyze stochastic evolutionary game dynamics in the large population double limit (LPDL). This regime refers to the iterated limit in which first the population size is taken to infinity and then the noise level in agents' decisions vanishes. The mathematical analysis of LPDL relies on a sample-path large deviations principle for a family of Markov chains on compact polyhedra. In this setting we formulate a set of conjectures and open problems which give a clear direction for future research activities.</p>

Copositivity meets D. C. optimization

<p style='text-indent:20px;'>Based on a work by M. Dur and J.-B. Hiriart-Urruty[<xref ref-type="bibr" rid="b3">3</xref>], we consider the problem of whether a symmetric matrix is copositive formulated as a difference of convex functions problem. The convex nondifferentiable function in this d.c. decomposition being proximable, we then apply a proximal-gradient method to approximate the related stationary points. Whereas, in [<xref ref-type="bibr" rid="b3">3</xref>], the DCA algorithm was used.</p>