{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:57Z","timestamp":1779174897128,"version":"3.51.4"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,11]]},"abstract":"<jats:p>\n            Decision making is challenging when there is more than one criterion to consider. In such cases, it is common to assign a goodness score to each item as a weighted sum of its attribute values and rank them accordingly. Clearly, the ranking obtained depends on the weights used for this summation. Ideally, one would want the ranked order not to change if the weights are changed slightly. We call this property\n            <jats:italic>stability<\/jats:italic>\n            of the ranking. A consumer of a ranked list may trust the ranking more if it has high stability. A producer of a ranked list prefers to choose weights that result in a stable ranking, both to earn the trust of potential consumers and because a stable ranking is intrinsically likely to be more meaningful.\n          <\/jats:p>\n          <jats:p>\n            In this paper, we develop a framework that can be used to assess the stability of a provided ranking and to obtain a stable ranking within an \"acceptable\" range of weight values (called \"the region of interest\"). We address the case where the user cares about the rank order of the entire set of items, and also the case where the user cares only about the top-\n            <jats:italic>k<\/jats:italic>\n            items. Using a geometric interpretation, we propose algorithms that produce stable rankings. In addition to theoretical analyses, we conduct extensive experiments on real datasets that validate our proposal.\n          <\/jats:p>","DOI":"10.14778\/3291264.3291269","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T13:13:43Z","timestamp":1549286023000},"page":"237-250","source":"Crossref","is-referenced-by-count":22,"title":["On obtaining stable rankings"],"prefix":"10.14778","volume":"12","author":[{"given":"Abolfazl","family":"Asudeh","sequence":"first","affiliation":[{"name":"University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. V.","family":"Jagadish","sequence":"additional","affiliation":[{"name":"University of Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerome","family":"Miklau","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julia","family":"Stoyanovich","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,11]]},"reference":[{"key":"e_1_2_1_1_1","article-title":"The order of things: What college rankings really tell us","author":"Gladwell M.","year":"2011","unstructured":"M. Gladwell . The order of things: What college rankings really tell us . The New Yorker Magazine , Feb 14, 2011 . M. Gladwell. The order of things: What college rankings really tell us. The New Yorker Magazine, Feb 14, 2011.","journal-title":"The New Yorker Magazine"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10734-010-9339-1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.3386\/w7227"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2331196"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193568"},{"key":"e_1_2_1_6_1","volume-title":"www.csmetrics.org\/. {Online","year":"2018","unstructured":"CSMetrics. www.csmetrics.org\/. {Online ; accessed April 2018 }. CSMetrics. www.csmetrics.org\/. {Online; accessed April 2018}."},{"key":"e_1_2_1_7_1","volume-title":"Algorithms in combinatorial geometry","author":"Edelsbrunner H.","year":"2012","unstructured":"H. Edelsbrunner . Algorithms in combinatorial geometry , volume 10 . Springer Science & Business Media , 2012 . H. Edelsbrunner. Algorithms in combinatorial geometry, volume 10. Springer Science & Business Media, 2012."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367854"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920980"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732275"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12098-5_6"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300079"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904491"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806451"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3291264.3291269"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217060"},{"key":"e_1_2_1_18_1","volume-title":"Arrangements of hyperplanes","author":"Orlik P.","year":"2013","unstructured":"P. Orlik and H. Terao . Arrangements of hyperplanes , volume 300 . Springer , 2013 . P. Orlik and H. Terao. Arrangements of hyperplanes, volume 300. Springer, 2013."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"e_1_2_1_20_1","volume-title":"Arrangements of hyperplanes and lie algebra homology. Inventiones mathematicae, 106(1)","author":"Schechtman V. V.","year":"1991","unstructured":"V. V. Schechtman and A. N. Varchenko . Arrangements of hyperplanes and lie algebra homology. Inventiones mathematicae, 106(1) , 1991 . V. V. Schechtman and A. N. Varchenko. Arrangements of hyperplanes and lie algebra homology. Inventiones mathematicae, 106(1), 1991."},{"key":"e_1_2_1_21_1","volume-title":"Arrangements and their applications. Handbook of computational geometry","author":"Agarwal P. K.","year":"2000","unstructured":"P. K. Agarwal and M. Sharir . Arrangements and their applications. Handbook of computational geometry , 2000 . P. K. Agarwal and M. Sharir. Arrangements and their applications. Handbook of computational geometry, 2000."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983205"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00199"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.2307\/3315916"},{"key":"e_1_2_1_27_1","first-page":"105","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Hickernell F. J.","year":"2012","unstructured":"F. J. Hickernell , L. Jiang , Y. Liu , and A. B. Owen . Guaranteed conservative fixed width confidence intervals via monte carlo sampling . In Monte Carlo and Quasi-Monte Carlo Methods 2012 , pages 105 -- 128 . Springer , 2013. F. J. Hickernell, L. Jiang, Y. Liu, and A. B. Owen. Guaranteed conservative fixed width confidence intervals via monte carlo sampling. In Monte Carlo and Quasi-Monte Carlo Methods 2012, pages 105--128. Springer, 2013."},{"key":"e_1_2_1_28_1","volume-title":"Probability inequalities for sums of bounded random variables. Journal of the American statistical association, 58(301):13--30","author":"Hoeffding W.","year":"1963","unstructured":"W. Hoeffding . Probability inequalities for sums of bounded random variables. Journal of the American statistical association, 58(301):13--30 , 1963 . W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American statistical association, 58(301):13--30, 1963."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte carlo methods","author":"Robert C. P.","year":"2004","unstructured":"C. P. Robert . Monte carlo methods . Wiley Online Library , 2004 . C. P. Robert. Monte carlo methods. Wiley Online Library, 2004."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: theory and examples","author":"Durrett R.","year":"2010","unstructured":"R. Durrett . Probability: theory and examples . Cambridge university press , 2010 . R. Durrett. Probability: theory and examples. Cambridge university press, 2010."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300080"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/377939.377946"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177692644"},{"key":"e_1_2_1_35_1","volume-title":"Mathematical methods of statistics (PMS-9)","author":"Cram\u00e9r H.","year":"2016","unstructured":"H. Cram\u00e9r . Mathematical methods of statistics (PMS-9) , volume 9 . Princeton university press , 2016 . H. Cram\u00e9r. Mathematical methods of statistics (PMS-9), volume 9. Princeton university press, 2016."},{"key":"e_1_2_1_36_1","volume-title":"Random tunneling by means of acceptance-rejection sampling for global optimization. Journal of optimization theory and applications, 62(2):255--277","author":"Lucidl S.","year":"1989","unstructured":"S. Lucidl and M. Piccioni . Random tunneling by means of acceptance-rejection sampling for global optimization. Journal of optimization theory and applications, 62(2):255--277 , 1989 . S. Lucidl and M. Piccioni. Random tunneling by means of acceptance-rejection sampling for global optimization. Journal of optimization theory and applications, 62(2):255--277, 1989."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/318242.318443"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_57"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.3923\/ajms.2011.66.70"},{"key":"e_1_2_1_40_1","volume-title":"Fifa rankings. www.fifa.com\/fifa-world-ranking\/ranking-table\/men\/index.html. {Online","author":"T. F. I. de Football Association (FIFA).","year":"2018","unstructured":"T. F. I. de Football Association (FIFA). Fifa rankings. www.fifa.com\/fifa-world-ranking\/ranking-table\/men\/index.html. {Online ; accessed April 2018 }. T. F. I. de Football Association (FIFA). Fifa rankings. www.fifa.com\/fifa-world-ranking\/ranking-table\/men\/index.html. {Online; accessed April 2018}."},{"key":"e_1_2_1_41_1","volume-title":"http:\/\/www.fifa.com\/fifa-world-ranking\/procedure\/men.html","author":"FA.","year":"2008","unstructured":"FI FA. Fifa\/coca-cola world ranking procedure. http:\/\/www.fifa.com\/fifa-world-ranking\/procedure\/men.html , 28 March 2008 . FIFA. Fifa\/coca-cola world ranking procedure. http:\/\/www.fifa.com\/fifa-world-ranking\/procedure\/men.html, 28 March 2008."},{"key":"e_1_2_1_42_1","volume-title":"www.bluenile.com\/diamond-search? {Online","year":"2018","unstructured":"BlueNile. www.bluenile.com\/diamond-search? {Online ; accessed Feb. 2018 }. BlueNile. www.bluenile.com\/diamond-search? {Online; accessed Feb. 2018}."},{"key":"e_1_2_1_43_1","unstructured":"US Department of Transportation's dataset. http:\/\/www.transtats.bts.gov\/DL_SelectFields.asp?Table_ID=236&DB_Short_Name=On-Time.  US Department of Transportation's dataset. http:\/\/www.transtats.bts.gov\/DL_SelectFields.asp?Table_ID=236&DB_Short_Name=On-Time."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316738"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687622"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142517"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1709"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035932"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447931"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316766"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687685"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920923"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0099-8"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164167"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335433"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/647224.718930"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133012"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/1370949"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137826"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3291264.3291269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:11:17Z","timestamp":1672222277000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3291264.3291269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["10.14778\/3291264.3291269"],"URL":"https:\/\/doi.org\/10.14778\/3291264.3291269","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}