Reflexive Monte-Carlo Search

Keywords: random number generator, pseudorandom numbers, linear generator, multi- ple recursive generator, tests of uniformity, random variate generation, inversion,

Let us mention that in [3] Janson has proven that for a random graph on n vertices with m edges various subgraph counts (spanning trees, Hamilton cycles, and perfect matchings)

Again, a key question is: How do we measure the uniformity of the point set P n ? Standard practice is to use a figure of merit that measures the discrepancy between the

Our investigation treats the average number of transversals of fixed size, the size of a random transversal as well as the probability that a random subset of the vertex set of a

Theorem 6 For the two player routing game over parallel links, the sequential best-response dynamics con- verges to the unique Nash equilibrium for any initial point x 0 ∈

In [22], the authors showed the existence of a mixed strategy Nash equilibrium for an n-player chance-constrained game, when the payoff vector of each player follows a

towards a Rayleigh-distributed random variable Θ, which gives a continuous analog to an earlier result by Janson on conditioned, finite- variance Galton-Watson trees.. The proofs

The number of generations entirely visited for recurrent random walks on random environment.. Pierre Andreoletti,