{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:57:19Z","timestamp":1768532239379,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:00:00Z","timestamp":1735862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","award":["UIDB\/04561\/2020"],"award-info":[{"award-number":["UIDB\/04561\/2020"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s40314-024-03062-1","type":"journal-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T08:23:02Z","timestamp":1735892582000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The complete set of efficient vectors for a pairwise comparison matrix"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0395-5972","authenticated-orcid":false,"given":"Susana","family":"Furtado","sequence":"first","affiliation":[]},{"given":"Charles R.","family":"Johnson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"key":"3062_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.3233\/FI-2016-1335","volume":"144","author":"K \u00c1bele-Nagy","year":"2016","unstructured":"\u00c1bele-Nagy K, Boz\u00f3ki S (2016) Efficiency analysis of simple perturbed pairwise comparison matrices. Fundam Inform 144:279\u2013289","journal-title":"Fundam Inform"},{"key":"3062_CR2","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1080\/01605682.2017.1409408","volume":"69","author":"K \u00c1bele-Nagy","year":"2018","unstructured":"\u00c1bele-Nagy K, Boz\u00f3ki S, Reb\u00e1k O (2018) Efficiency analysis of double perturbed pairwise comparison matrices. J Oper Res Soc 69:707\u2013713","journal-title":"J Oper Res Soc"},{"key":"3062_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10479-018-2888-x","volume":"274","author":"M Anholcer","year":"2019","unstructured":"Anholcer M, F\u00fcl\u00f6p J (2019) Deriving priorities from inconsistent PCM using network algorithms. Ann Oper Res 274:57\u201374","journal-title":"Ann Oper Res"},{"key":"3062_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0217595908001754","volume":"25","author":"G Bajwa","year":"2008","unstructured":"Bajwa G, Choo EU, Wedley WC (2008) Effectiveness analysis of deriving priority vectors from reciprocal pairwise comparison matrices. Asia-Pac J Oper Res 25:279\u2013299","journal-title":"Asia-Pac J Oper Res"},{"key":"3062_CR5","volume-title":"Digraphs, theory, algorithms and applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen J, Gutin GZ (2009) Digraphs, theory, algorithms and applications. Springer, London"},{"key":"3062_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00186-006-0077-1","volume":"64","author":"R Blanquero","year":"2006","unstructured":"Blanquero R, Carrizosa E, Conde E (2006) Inferring efficient weights from pairwise comparison matrices. Math Methods Oper Res 64:271\u2013284","journal-title":"Math Methods Oper Res"},{"key":"3062_CR7","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1080\/02331934.2014.903399","volume":"63","author":"S Boz\u00f3ki","year":"2014","unstructured":"Boz\u00f3ki S (2014) Inefficient weights from pairwise comparison matrices with arbitrarily small inconsistency. Optimization 63:1893\u20131901","journal-title":"Optimization"},{"key":"3062_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ejor.2017.06.033","volume":"264","author":"S Boz\u00f3ki","year":"2018","unstructured":"Boz\u00f3ki S, F\u00fcl\u00f6p J (2018) Efficient weight vectors from pairwise comparison matrices. Eur J Oper Res 264:419\u2013427","journal-title":"Eur J Oper Res"},{"key":"3062_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jmaa.1995.1067","volume":"190","author":"E Carrizosa","year":"1995","unstructured":"Carrizosa E, Conde E, Fernandez FR, Mu\u00f1oz M, Puerto J (1995) Pareto optimality in linear regression. J Math Anal Appl 190:129\u2013141","journal-title":"J Math Anal Appl"},{"key":"3062_CR10","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1016\/S0305-0548(03)00042-X","volume":"31","author":"E Choo","year":"2004","unstructured":"Choo E, Wedley W (2004) A common framework for deriving preference values from pairwise comparison matrices. Comput Oper Res 31:893\u2013908","journal-title":"Comput Oper Res"},{"key":"3062_CR11","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ijar.2021.09.007","volume":"139","author":"H Cruz","year":"2021","unstructured":"Cruz H, Fernandes R, Furtado S (2021) Efficient vectors for simple perturbed consistent matrices. Int J Approx Reason 139:54\u201368","journal-title":"Int J Approx Reason"},{"key":"3062_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10100-011-0212-9","volume":"21","author":"TK Dijkstra","year":"2013","unstructured":"Dijkstra TK (2013) On the extraction of weights from pairwise comparison matrices. Cent Eur J Oper Res 21:103\u2013123","journal-title":"Cent Eur J Oper Res"},{"key":"3062_CR13","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.ejor.2021.08.012","volume":"298","author":"R Fernandes","year":"2022","unstructured":"Fernandes R, Furtado S (2022) Efficiency of the principal eigenvector of some triple perturbed consistent matrices. Eur J Oper Res 298:1007\u20131015","journal-title":"Eur J Oper Res"},{"key":"3062_CR14","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1080\/02331934.2022.2070067","volume":"72","author":"S Furtado","year":"2023","unstructured":"Furtado S (2023) Efficient vectors for double perturbed consistent matrices. Optimization 72:2679\u20132701","journal-title":"Optimization"},{"key":"3062_CR15","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s10479-023-05771-y","volume":"332","author":"S Furtado","year":"2024","unstructured":"Furtado S, Johnson CR (2024) Efficient vectors in priority setting methodology. Ann Oper Res 332:743\u2013764","journal-title":"Ann Oper Res"},{"key":"3062_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.laa.2023.10.001","volume":"680","author":"S Furtado","year":"2024","unstructured":"Furtado S, Johnson CR (2024) Efficiency of any weighted geometric mean of the columns of a pairwise-comparison matrix. Linear Algebra Appl 680:83\u201392","journal-title":"Linear Algebra Appl"},{"key":"3062_CR17","volume":"480","author":"S Furtado","year":"2024","unstructured":"Furtado S, Johnson CR (2024) Efficiency analysis for the Perron vector of a reciprocal matrix. Appl Math Comput 480:128913","journal-title":"Appl Math Comput"},{"key":"3062_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/0377-2217(93)90165-J","volume":"69","author":"B Golany","year":"1993","unstructured":"Golany B, Kress M (1993) A multicriteria evaluation of methods for obtaining weights from ratio-scale matrices. Eur J Oper Res 69:210\u2013220","journal-title":"Eur J Oper Res"},{"key":"3062_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"RA Horn","year":"1985","unstructured":"Horn RA, Johnson CR (1985) Matrix analysis. Cambridge University Press, Cambridge"},{"key":"3062_CR20","unstructured":"Moon J (2013) Topics on tournaments. http:\/\/www.gutenberg.org\/files\/42833\/42833-pdf.pdf"},{"key":"3062_CR21","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/0022-2496(77)90033-5","volume":"15","author":"TL Saaty","year":"1977","unstructured":"Saaty TL (1977) A scaling method for priorities in hierarchical structures. J Math Psychol 15:234\u2013281","journal-title":"J Math Psychol"},{"key":"3062_CR22","volume-title":"The analytic hierarchy process","author":"TL Saaty","year":"1980","unstructured":"Saaty TL (1980) The analytic hierarchy process. McGraw-Hill, New York"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03062-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-03062-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-03062-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T06:06:06Z","timestamp":1741932366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-03062-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["3062"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-03062-1","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,3]]},"assertion":[{"value":"22 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"100"}}