activity
20022026
most citedNotes on the occupancy problem with infinitely many boxes: general asymptotics and power laws

115 citations · 388 across the 61 of their papers we have counts for

collaborators
Showing 2011Show all

11 papers · 1 filter

math.PR2011

Regenerative compositions in the case of slow variation: A renewal theory approach

Alexander Gnedin, Alexander Iksanov

A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous…

math.RT2011

Block characters of the symmetric groups

Alexander Gnedin, Vadim Gorin, Sergei Kerov

Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters…

math.PR2011★ 8 cited

Moments of random sums and Robbins' problem of optimal stopping

Alexander Gnedin, Alexander Iksanov

Robbins' problem of optimal stopping asks one to minimise the expected {\it rank} of observation chosen by some nonanticipating stopping rule. We settle a conjecture regarding the…

math.HO2011

The Unlucky Door

Alexander Gnedin

In the famous Three-Door-Game Monte cannot help to win all the time by signaling location of the prize, using only the freedom he allowed to use. No matter which strategies played,…

math.HO2011★ 4 cited

The Monty Hall Problem in the Game Theory Class

Alexander Gnedin

The basic Monty Hall problem is explored to introduce into the fundamental concepts of the game theory and to give a complete Bayesian and a (noncooperative) game-theoretic analysi…

math.HO2011

The Doors

Alexander Gnedin

We emphasize the dominance in the Monty Hall problem, both in the classical scenario and its multi-door generalization. This is used to show optimality of the class of always-switc…