English

Convergence in a multidimensional randomized Keynesian beauty contest

Probability 2015-04-27 v1

Abstract

We study the asymptotics of a Markovian system of N3N \geq 3 particles in [0,1]d[0,1]^d in which, at each step in discrete time, the particle farthest from the current centre of mass is removed and replaced by an independent U[0,1]dU [0,1]^d random particle. We show that the limiting configuration contains N1N-1 coincident particles at a random location ξN[0,1]d\xi_N \in [0,1]^d. A key tool in the analysis is a Lyapunov function based on the squared radius of gyration (sum of squared distances) of the points. For d=1 we give additional results on the distribution of the limit ξN\xi_N, showing, among other things, that it gives positive probability to any nonempty interval subset of [0,1][0,1], and giving a reasonably explicit description in the smallest nontrivial case, N=3.

Keywords

Cite

@article{arxiv.1301.0887,
  title  = {Convergence in a multidimensional randomized Keynesian beauty contest},
  author = {Michael Grinfeld and Stanislav Volkov and Andrew R. Wade},
  journal= {arXiv preprint arXiv:1301.0887},
  year   = {2015}
}

Comments

26 pages, 4 figures

R2 v1 2026-06-21T23:04:19.605Z