On the hardness of finding subsets with equal average

DOI10.1016/j.ipl.2013.04.001zbMath1371.68096DBLPjournals/ipl/ElkindO13OpenAlexW2026014538WikidataQ59592280 ScholiaQ59592280MaRDI QIDQ2444739

Edith Elkind, James B. Orlin

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.04.001

zbMATH Keywords

computational complexityexpected utility theorysubset ranking

Mathematics Subject Classification ID

Individual preferences (91B08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item

This page was built for publication: On the hardness of finding subsets with equal average