“…We mentioned [439,427] as classical references on this topic, but similar results can be found in [147,209,512,531,446,445,444,559,199,116,487]. Among extensions and similar studies, we also find discretization for different kinds of variational inequalities [27,23,43,388,462], set-valued perturbations [169,237], state-dependent FOSwP [39,46,26,170,293,296,376], time-delay FOSwP and SOSwP [235,236,117,450,174,177], time-dependent maximal monotone DIs [64,153], proximal algorithms, i.e., implicit or backward Euler discretization of (2.16), for optimization problems [48,57,286,412,477] (it is known that an explicit Euler method has strong drawbacks [477,Sections 3.3,6.3]). Systems with prox-regular set-valued mappings have also been studied using time-stepping algorithms [42,…”