{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:18:25Z","timestamp":1765531105844,"version":"3.48.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T00:00:00Z","timestamp":1762473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"University of Amazonas State","award":["1.02.011304.026190\/2022-07"],"award-info":[{"award-number":["1.02.011304.026190\/2022-07"]}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004916","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado do Amazonas","doi-asserted-by":"publisher","award":["22-23"],"award-info":[{"award-number":["22-23"]}],"id":[{"id":"10.13039\/501100004916","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00236-025-00511-0","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:15:15Z","timestamp":1762506915000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient alternative strategy for finding prices in envy-free perfect matchings"],"prefix":"10.1007","volume":"62","author":[{"given":"Marcos","family":"Salvatierra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan G.","family":"Colonna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Salvatierra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alcides de C.","family":"Amorim Neto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,7]]},"reference":[{"key":"511_CR1","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201905, pp. 1164\u20131173. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2005). http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070598"},{"key":"511_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.dam.2018.03.034","volume":"261","author":"C Arbib","year":"2019","unstructured":"Arbib, C., Kara\u015fan, O.E., Pinar, M.\u00c7.: On envy-free perfect matching. Discrete Appl. Math. 261, 22\u201327 (2019). https:\/\/doi.org\/10.1016\/j.dam.2018.03.034. (GO X Meeting, Rigi Kaltbad (CH), July 10\u201314, 2016)","journal-title":"Discrete Appl. Math."},{"key":"511_CR3","unstructured":"Gamow, G., Stern, M.: Puzzle-math, edn. Viking Adult, (1958). http:\/\/www.worldcat.org\/isbn\/0670583359."},{"key":"511_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/1907319","volume":"17","author":"H Steinhaus","year":"1949","unstructured":"Steinhaus, H.: Sur la division pragmatique. Econometrica 17, 315\u2013319 (1949)","journal-title":"Econometrica"},{"issue":"1","key":"511_CR5","first-page":"45","volume":"7","author":"DK Foley","year":"1967","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Economic Essays 7(1), 45\u201398 (1967)","journal-title":"Yale Economic Essays"},{"key":"511_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-1-349-07357-3_12","volume-title":"Arrow and the Foundations of the Theory of Economic Policy","author":"ES Maskin","year":"1987","unstructured":"Maskin, E.S.: On the Fair Allocation of Indivisible Goods. In: Arrow and the Foundations of the Theory of Economic Policy, pp. 341\u2013349. Palgrave Macmillan UK, London (1987). https:\/\/doi.org\/10.1007\/978-1-349-07357-3_12"},{"issue":"2","key":"511_CR7","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1137\/1030084","volume":"30","author":"D Saari","year":"1988","unstructured":"Saari, D.: Fair Allocation (H. Peyton Young). SIAM Review 30(2), 350\u2013352 (1988). https:\/\/doi.org\/10.1137\/1030084","journal-title":"SIAM Review"},{"issue":"1","key":"511_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0531(74)90075-1","volume":"9","author":"HR Varian","year":"1974","unstructured":"Varian, H.R.: Equity, envy, and efficiency. J. Econ. Theory 9(1), 63\u201391 (1974). https:\/\/doi.org\/10.1016\/0022-0531(74)90075-1","journal-title":"J. Econ. Theory"},{"issue":"3","key":"511_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/3105786","volume":"5","author":"E Anshelevich","year":"2017","unstructured":"Anshelevich, E., Kar, K., Sekar, S.: Envy-free pricing in large markets: approximating revenue and welfare. ACM Trans. Econ. Comput. 5(3), 16\u201311642 (2017). https:\/\/doi.org\/10.1145\/3105786","journal-title":"ACM Trans. Econ. Comput."},{"key":"511_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-08404-6_7","volume":"662","author":"V Bil\u00f2","year":"2017","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G.: Approximating the revenue maximization problem with sharp demands. Theor. Comput. Sci. 662, 9\u201330 (2017). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_7","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"511_CR11","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1137\/080740970","volume":"40","author":"N Chen","year":"2011","unstructured":"Chen, N., Ghosh, A., Vassilvitskii, S.: Optimal envy-free pricing with metric substitutability. SIAM J. Comput. 40(3), 623\u2013645 (2011)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"511_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2567923","volume":"10","author":"N Chen","year":"2014","unstructured":"Chen, N., Deng, X.: Envy-free pricing in multi-item markets. ACM Transactions on Algorithms 10(2), 1\u201315 (2014)","journal-title":"ACM Transactions on Algorithms"},{"issue":"3","key":"511_CR13","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1007\/s10878-014-9817-y","volume":"31","author":"N Chen","year":"2016","unstructured":"Chen, N., Deng, X., Goldberg, P.W., Zhang, J.: On revenue maximization with sharp multi-unit demands. J. Comb. Optim. 31(3), 1174\u20131205 (2016). https:\/\/doi.org\/10.1007\/s10878-014-9817-y","journal-title":"J. Comb. Optim."},{"issue":"2","key":"511_CR14","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.disopt.2006.06.005","volume":"5","author":"O G\u00fcnl\u00fck","year":"2008","unstructured":"G\u00fcnl\u00fck, O.: A pricing problem under monge property. Discrete Optimization 5(2), 328\u2013336 (2008)","journal-title":"Discrete Optimization"},{"issue":"10","key":"511_CR15","doi-asserted-by":"publisher","DOI":"10.3390\/a14100279","volume":"14","author":"MM Salvatierra","year":"2021","unstructured":"Salvatierra, M.M., Salvatierra, M., Colonna, J.G.: Short communication: optimally solving the unit-demand envy-free pricing problem with metric substitutability in cubic time. Algorithms 14(10), 279 (2021). https:\/\/doi.org\/10.3390\/a14100279","journal-title":"Algorithms"},{"key":"511_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York, NY, USA (2007)"},{"issue":"8","key":"511_CR17","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1109\/26.310604","volume":"42","author":"B Awerbuch","year":"1994","unstructured":"Awerbuch, B., Bar-Noy, A., Gopal, M.: Approximate distributed bellman-ford algorithms. IEEE Trans. Commun. 42(8), 2515\u20132517 (1994). https:\/\/doi.org\/10.1109\/26.310604","journal-title":"IEEE Trans. Commun."},{"key":"511_CR18","doi-asserted-by":"publisher","unstructured":"Bannister, M.J., Eppstein, D.: Randomized speedup of the bellman\u2013ford algorithm. In: 2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 41\u201347 (2012). https:\/\/doi.org\/10.1137\/1.9781611973020.6. SIAM","DOI":"10.1137\/1.9781611973020.6"},{"issue":"8","key":"511_CR19","doi-asserted-by":"publisher","first-page":"2222","DOI":"10.1109\/TPDS.2015.2485994","volume":"27","author":"F Busato","year":"2016","unstructured":"Busato, F., Bombieri, N.: An efficient implementation of the bellman-ford algorithm for kepler gpu architectures. IEEE Trans. Parallel Distrib. Syst. 27(8), 2222\u20132233 (2016). https:\/\/doi.org\/10.1109\/TPDS.2015.2485994","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"511_CR20","doi-asserted-by":"publisher","unstructured":"Surve, G.G., Shah, M.A.: Parallel implementation of bellman-ford algorithm using cuda architecture. In: 2017 International Conference of Electronics, Communication and Aerospace Technology (ICECA), 2, 16\u201322 (2017). https:\/\/doi.org\/10.1109\/ICECA.2017.8212794","DOI":"10.1109\/ICECA.2017.8212794"},{"key":"511_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jda.2017.01.001","volume":"42","author":"Y Dinitz","year":"2017","unstructured":"Dinitz, Y., Itzhak, R.: Hybrid bellman-ford-dijkstra algorithm. J. Discrete Algorithms 42, 35\u201344 (2017). https:\/\/doi.org\/10.1016\/j.jda.2017.01.001","journal-title":"J. Discrete Algorithms"},{"key":"511_CR22","doi-asserted-by":"publisher","unstructured":"Cheng, C., Riley, R., Kumar, S.P.R., Garcia-Luna-Aceves, J.J.: A loop-free extended bellman-ford routing protocol without bouncing effect. In: Symposium Proceedings on Communications Architectures & Protocols. SIGCOMM \u201989, pp. 224\u2013236. Association for Computing Machinery, New York, NY, USA (1989). https:\/\/doi.org\/10.1145\/75246.75269","DOI":"10.1145\/75246.75269"},{"issue":"3","key":"511_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0893-9659(93)90022-F","volume":"6","author":"AV Goldberg","year":"1993","unstructured":"Goldberg, A.V., Radzik, T.: A heuristic improvement of the bellman-ford algorithm. Appl. Math. Lett. 6(3), 1\u20135 (1993)","journal-title":"Appl. Math. Lett."},{"key":"511_CR24","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF01585517","volume":"7","author":"U Pape","year":"1974","unstructured":"Pape, U.: Implementation and efficiency of moore-algorithms for the shortest route problem. Mathematical Programming 7, 212\u2013222 (1974)","journal-title":"Mathematical Programming"},{"issue":"2","key":"511_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/net.3230140206","volume":"14","author":"S Pallottino","year":"1984","unstructured":"Pallottino, S.: Shortest-path methods: complexity, interrelations and new propositions. Networks 14(2), 257\u2013267 (1984). https:\/\/doi.org\/10.1002\/net.3230140206","journal-title":"Networks"},{"issue":"2","key":"511_CR26","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10589-009-9254-5","volume":"48","author":"R Shioda","year":"2011","unstructured":"Shioda, R., Tun\u00e7el, L., Myklebust, T.G.J.: Maximum utility product pricing models and algorithms based on reservation price. Comp. Opt. and Appl. 48(2), 157\u2013198 (2011). https:\/\/doi.org\/10.1007\/s10589-009-9254-5","journal-title":"Comp. Opt. and Appl."},{"key":"511_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cor.2015.11.013","volume":"69","author":"TGJ Myklebust","year":"2016","unstructured":"Myklebust, T.G.J., Sharpe, M.A., Tun\u00e7el, L.: Efficient heuristic algorithms for maximum utility product pricing problems. Computers & OR 69, 25\u201339 (2016). https:\/\/doi.org\/10.1016\/j.cor.2015.11.013","journal-title":"Computers & OR"},{"issue":"1","key":"511_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. Journal of the ACM 61(1), 1\u201323 (2014)","journal-title":"Journal of the ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00511-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00511-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00511-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:14:41Z","timestamp":1765530881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00511-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["511"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00511-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2025,11,7]]},"assertion":[{"value":"18 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"41"}}