This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing 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 has not yet received a rating on the project's importance scale. Statistics Low‑importance 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 Low This article has been rated as Low-importance on the importance scale. Mathematics Low‑priority 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 Low This article has been rated as Low-priority on the project's priority scale.

I wonder whether there's literature on building the table to maximize ${\displaystyle \Sigma U_{i}}$, 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