This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles
This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics articles
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Latest comment: 4 years ago2 comments1 person in discussion
I wonder whether there's literature on building the table to maximize , i.e., minimize the probability of consulting K. —Tamfang (talk) 21:03, 24 November 2018 (UTC)Reply
Oops, there it is: Doing this optimally turns out to be NP hard, but a “Robin Hood” heuristic comes reasonably close: rob from the richest and give to the poorest. Cute, but I'll add a link to greedy algorithm. —Tamfang (talk) 19:59, 26 September 2019 (UTC)Reply
