Balls and bins and the infinite process with random deletions

We consider an infinite balls-into-bins process with deletions where in each discrete step t a coin is tossed as to whether, with probability β(t) ∈ (0, 1), a new ball is allocated using the Greedy[2] strategy (which places the ball in the lower loaded of two bins sampled uniformly at random) or, wi...

Full description

Bibliographic Details

Main Authors:	Petra Berenbrink, Tom Friedetzky, Peter Kling, Lars Nagel
Format:	Default Conference proceeding
Published:	2026
Subjects:	Balls-into-bins process Load balancing Randomized algorithms Dynamic allocation Deletions in load distribution
Online Access:	https://hdl.handle.net/2134/30601424.v1
Tags:	Add Tag No Tags, Be the first to tag this record!