- Conference Paper
Rights / licenseCreative Commons Attribution 3.0 Unported
We analyze a little riddle that has challenged mathematicians for half a century. Imagine three clubs catering to people with some niche interest. Everyone willing to join a club has done so and nobody new will pick up this eccentric hobby for the foreseeable future, thus the mutually exclusive clubs compete for a common constituency. Members are highly invested in their chosen club; only a targeted campaign plus prolonged personal persuasion can convince them to consider switching. Even then, they will never be enticed into a bigger group as they naturally pride themselves in avoiding the mainstream. Therefore each club occasionally starts a campaign against a larger competitor and sends its own members out on a recommendation program. Each will win one person over; the small club can thus effectively double its own numbers at the larger one’s expense. Is there always a risk for one club to wind up with zero members, forcing it out of business? If so, how many campaign cycles will this take? Show more
Book title10th International Conference on Fun with Algorithms (FUN 2021)
Journal / seriesLeibniz International Proceedings in Informatics
Pages / Article No.
PublisherSchloss Dagstuhl-Leibniz-Zentrum für Informatik
SubjectPitcher Pouring Problem; Water Jug Riddle; Water Bucket Problem; Vessel Puzzle; Complexity; Die Hard
NotesConference postponed due to Corona virus (COVID-19). Conference rescheduled from June 8–10, 2020 to May 30 – June 1, 2021.
MoreShow all metadata