A provably optimal method for keeping in touch with friends

Keeping in touch with friends is trivially easy via a random algorithm, which can be proven to satisfy arbitrary threshold constraints via Hoeffding’s bound. The algorithm Let \(k\) be the number of friends and \(m\) be the time period of contact. Then, every \(m\) days, pick a friend randomly under a uniform distribution. Proof It …

A provably optimal method for keeping in touch with friends Read More »