{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T21:13:01Z","timestamp":1778188381365,"version":"3.51.4"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T00:00:00Z","timestamp":1776384000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T00:00:00Z","timestamp":1776384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>This study examines a resource-sharing problem involving multiple parties that agree to use a set of capacities together. We start with modeling the whole problem as a mathematical program, where all parties are required to exchange information to obtain the optimal objective function value. This information bears private data from each party in terms of the coefficients used in the mathematical program. Moreover, the parties also consider the individual optimal solutions as private. In this setting, the concern for the parties is the privacy of their data and their optimal allocations. We propose a two-step approach to meet the privacy requirements of the parties. In the first step, we obtain a reformulated model that is amenable to a decomposition scheme. Although this scheme eliminates almost all data exchanges, it does not provide a formal privacy guarantee. In the second step, we provide this guarantee with a local differential privacy algorithm, which does not need a trusted aggregator, at the expense of deviating slightly from the optimality. We provide bounds on this deviation and discuss the consequences of these theoretical results. We also propose a novel modification to increase the efficiency of the algorithm in terms of reducing the theoretical optimality gap. The study ends with a numerical experiment on a planning problem that demonstrates an application of the proposed approach. As we work with a general linear optimization model, our analysis and discussion can be used in different application areas, including production planning, logistics, and revenue management.<\/jats:p>","DOI":"10.1007\/s10479-026-07199-6","type":"journal-article","created":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T06:23:30Z","timestamp":1776407010000},"page":"1007-1041","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear optimization with local differential privacy for resource sharing"],"prefix":"10.1007","volume":"360","author":[{"given":"Utku","family":"Karaca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4569-7070","authenticated-orcid":false,"given":"Nur\u015fen","family":"Ayd\u0131n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sinan","family":"Y\u0131ld\u0131r\u0131m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u015e. \u0130lker","family":"Birbil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,17]]},"reference":[{"issue":"3","key":"7199_CR1","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1016\/j.ejor.2015.06.045","volume":"247","author":"M Albrecht","year":"2015","unstructured":"Albrecht, M., & Stadtler, H. (2015). Coordinating decentralized linear programs by exchange of primal information. Eur. J. Oper. Res., 247(3), 788\u2013796.","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"7199_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1111\/j.1937-5956.2010.01158.x","volume":"20","author":"K Amaruchkul","year":"2011","unstructured":"Amaruchkul, K., Cooper, W. L., & Gupta, D. (2011). A note on air-cargo capacity contracts. Prod. Oper. Manag., 20(1), 152\u2013162.","journal-title":"Prod. Oper. Manag."},{"key":"7199_CR3","unstructured":"Apple Inc. (2017). Differential privacy team: Learning with privacy at scale. https:\/\/machinelearning.apple.com\/research\/learning-with-privacy-at-scale (accessed on 20 February 2025)."},{"key":"7199_CR4","unstructured":"Apple Inc. (2023). Differential privacy overview. https:\/\/www.apple.com\/privacy\/docs\/Differential_Privacy_Overview.pdf (accessed on 20 February 2025)."},{"key":"7199_CR5","first-page":"293","volume":"2003","author":"M Atallah","year":"2003","unstructured":"Atallah, M., Elmongui, H., Deshpande, V., & Schwarz, L. (2003). Secure supply-chain protocols. In EEE International Conference on E-Commerce, 2003, 293\u2013302.","journal-title":"In EEE International Conference on E-Commerce"},{"key":"7199_CR6","doi-asserted-by":"crossref","unstructured":"Bassily, R., Smith, A., and Thakurta, A. (2014). Differentially private empirical risk minimization: Efficient algorithms and tight error bounds. arXiv preprint arXiv:1405.7085.","DOI":"10.1109\/FOCS.2014.56"},{"key":"7199_CR7","doi-asserted-by":"crossref","unstructured":"Bednarz, A., Bean, N., and Roughan, M. (2009). Hiccups on the road to privacy-preserving linear programming. In Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, pages 117\u2013120.","DOI":"10.1145\/1655188.1655207"},{"key":"7199_CR8","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D. P. (2015). Convex Optimization Algorithms. Belmont: Athena Scientific."},{"issue":"3","key":"7199_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1287\/trsc.2013.0469","volume":"48","author":"\u015e\u0130 Birbil","year":"2014","unstructured":"Birbil, \u015e\u0130, Frenk, J., Gromicho, J. A., & Zhang, S. (2014). A network airline revenue management framework based on decomposition by origins and destinations. Transp. Sci., 48(3), 313\u2013333.","journal-title":"Transp. Sci."},{"key":"7199_CR10","unstructured":"Boyd, S., Xiao, L., and Mutapcic, A. (2003). Subgradient methods. Lecture Notes of EE392o, Stanford University, Autumn Quarter. http:\/\/web.mit.edu\/6.976\/www\/notes\/subgrad_method.pdf (accessed on 20 February 2025)."},{"key":"7199_CR11","doi-asserted-by":"crossref","unstructured":"Bun, M. and Steinke, T. (2016). Concentrated differential privacy: Simplifications, extensions, and lower bounds. In Theory of Cryptography Conference, pages 635\u2013658. Springer.","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"7199_CR12","first-page":"1069","volume":"12","author":"K Chaudhuri","year":"2011","unstructured":"Chaudhuri, K., Monteleoni, C., & Sarwate, A. D. (2011). Differentially private empirical risk minimization. J. Mach. Learn. Res., 12, 1069\u20131109.","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"7199_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1287\/opre.2022.2347","volume":"71","author":"X Chen","year":"2023","unstructured":"Chen, X., Miao, S., & Wang, Y. (2023). Differential privacy in personalized pricing with nonparametric demand models. Oper. Res., 71(2), 581\u2013602.","journal-title":"Oper. Res."},{"issue":"7","key":"7199_CR14","doi-asserted-by":"publisher","first-page":"4878","DOI":"10.1287\/mnsc.2021.4129","volume":"68","author":"X Chen","year":"2022","unstructured":"Chen, X., Simchi-Levi, D., & Wang, Y. (2022). Privacy-preserving dynamic personalized pricing with demand learning. Manage. Sci., 68(7), 4878\u20134898.","journal-title":"Manage. Sci."},{"issue":"7","key":"7199_CR15","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1287\/mnsc.2016.2434","volume":"63","author":"SY Chun","year":"2016","unstructured":"Chun, S. Y., Kleywegt, A. J., & Shapiro, A. (2016). When friends become competitors: the design of resource exchange alliances. Manage. Sci., 63(7), 2127\u20132145.","journal-title":"Manage. Sci."},{"key":"7199_CR16","unstructured":"Cohen-Addad, V., Esencayi, Y., Fan, C., Gaboradi, M., Li, S., and Wang, D. (2022). On facility location problem in the local differential privacy model. In Camps-Valls, G., Ruiz, F. J.\u00a0R., and Valera, I., editors, Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, volume 151 of Proceedings of Machine Learning Research, pages 3914\u20133929. PMLR."},{"key":"7199_CR17","doi-asserted-by":"crossref","unstructured":"Cummings, R., Kearns, M., Roth, A., and Wu, Z.\u00a0S. (2015). Privacy and truthful equilibrium selection for aggregative games. In Markakis, E. and Sch\u00e4fer, G., editors, Web and Internet Economics, pages 286\u2013299, Berlin, Heidelberg. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-48995-6_21"},{"issue":"4","key":"7199_CR18","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1287\/msom.2019.0774","volume":"22","author":"S Ding","year":"2020","unstructured":"Ding, S., & Kaminsky, P. M. (2020). Centralized and decentralized warehouse logistics collaboration. Manufacturing & Service Operations Management, 22(4), 812\u2013831.","journal-title":"Manufacturing & Service Operations Management"},{"key":"7199_CR19","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TSIPN.2021.3062985","volume":"7","author":"T Ding","year":"2021","unstructured":"Ding, T., Zhu, S., Chen, C., Xu, J., & Guan, X. (2021). Differentially private distributed resource allocation via deviation tracking. IEEE Transactions on Signal and Information Processing over Networks, 7, 222\u2013235.","journal-title":"IEEE Transactions on Signal and Information Processing over Networks"},{"issue":"1","key":"7199_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/rssb.12454","volume":"84","author":"J Dong","year":"2022","unstructured":"Dong, J., Roth, A., & Su, W. J. (2022). Gaussian Differential Privacy. J. R. Stat. Soc. Ser. B Stat Methodol., 84(1), 3\u201337.","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."},{"key":"7199_CR21","doi-asserted-by":"crossref","unstructured":"Duchi, J.\u00a0C., Jordan, M.\u00a0I., and Wainwright, M.\u00a0J. (2013). Local privacy and statistical minimax rates. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pages 429\u2013438.","DOI":"10.1109\/FOCS.2013.53"},{"key":"7199_CR22","first-page":"1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C. (2006). Differential privacy. In M. Bugliesi, B. Preneel, V. Sassone, & I. Wegener (Eds.), Automata, Languages and Programming (pp. 1\u201312). Berlin Heidelberg: Springer."},{"key":"7199_CR23","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., and Smith, A. (2006). Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography Conference, pages 265\u2013284. Springer.","DOI":"10.1007\/11681878_14"},{"issue":"3\u20134","key":"7199_CR24","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., & Roth, A. (2014). The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci., 9(3\u20134), 211\u2013407.","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"7199_CR25","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Pihur, V., and Korolova, A. (2014). Rappor: Randomized aggregatable privacy-preserving ordinal response. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201914, page 1054\u20131067, New York, NY, USA. Association for Computing Machinery.","DOI":"10.1145\/2660267.2660348"},{"issue":"10","key":"7199_CR26","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1080\/07408170008967451","volume":"32","author":"K Ertogral","year":"2000","unstructured":"Ertogral, K., & Wu, S. D. (2000). Auction-theoretic coordination of production planning in the supply chain. IIE Trans., 32(10), 931\u2013940.","journal-title":"IIE Trans."},{"key":"7199_CR27","unstructured":"Geyer, R.\u00a0C., Klein, T., and Nabi, M. (2017). Differentially private federated learning: A client level perspective. arXiv:1712.07557. (accessed on 20 February 2025)."},{"key":"7199_CR28","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H.\u00a0R., and Johansson, M. (2015). Global convergence of the heavy-ball method for convex optimization. In 2015 European Control Conference (ECC), pages 310\u2013315. IEEE.","DOI":"10.1109\/ECC.2015.7330562"},{"issue":"3","key":"7199_CR29","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1111\/itor.12205","volume":"23","author":"M Guajardo","year":"2016","unstructured":"Guajardo, M., & R\u00f6nnqvist, M. (2016). A review on cost allocation methods in collaborative transportation. Int. Trans. Oper. Res., 23(3), 371\u2013392.","journal-title":"Int. Trans. Oper. Res."},{"issue":"8","key":"7199_CR30","doi-asserted-by":"publisher","first-page":"3554","DOI":"10.1287\/mnsc.2017.2796","volume":"64","author":"L Guo","year":"2018","unstructured":"Guo, L., & Wu, X. (2018). Capacity sharing between competitors. Manage. Sci., 64(8), 3554\u20133573.","journal-title":"Manage. Sci."},{"key":"7199_CR31","doi-asserted-by":"crossref","unstructured":"Hale, M. and Egerstedty, M. (2015). Differentially private cloud-based multi-agent optimization with constraints. In 2015 American Control Conference (ACC), pages 1235\u20131240.","DOI":"10.1109\/ACC.2015.7170902"},{"issue":"1","key":"7199_CR32","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TAC.2016.2541298","volume":"62","author":"S Han","year":"2016","unstructured":"Han, S., Topcu, U., & Pappas, G. J. (2016). Differentially private distributed constrained optimization. IEEE Trans. Autom. Control, 62(1), 50\u201364.","journal-title":"IEEE Trans. Autom. Control"},{"issue":"9","key":"7199_CR33","doi-asserted-by":"publisher","first-page":"5482","DOI":"10.1287\/mnsc.2022.4582","volume":"69","author":"M Hastings","year":"2022","unstructured":"Hastings, M., Falk, B. H., & Tsoukalas, G. (2022). Privacy-preserving network analytics. Manage. Sci., 69(9), 5482\u20135500.","journal-title":"Manage. Sci."},{"issue":"1","key":"7199_CR34","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11590-012-0572-7","volume":"8","author":"Y Hong","year":"2014","unstructured":"Hong, Y., & Vaidya, J. (2014). An inference-proof approach to privacy-preserving horizontally partitioned linear programs. Optimization Letters, 8(1), 267\u2013277.","journal-title":"Optimization Letters"},{"key":"7199_CR35","doi-asserted-by":"crossref","unstructured":"Hoogervorst, R., Zhang, Y., Tillem, G., Erkin, Z., & S., V. (2019). Solving bin-packing problems under privacy preservation: Possibilities and trade-offs. Inf. Sci.,500, 203\u2013216.","DOI":"10.1016\/j.ins.2019.05.011"},{"key":"7199_CR36","doi-asserted-by":"crossref","unstructured":"Hsu, J., Huang, Z., Roth, A., and Wu, Z.\u00a0S. (2016). Jointly private convex programming. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 580\u2013599. SIAM.","DOI":"10.1137\/1.9781611974331.ch43"},{"key":"7199_CR37","doi-asserted-by":"crossref","unstructured":"Hsu, J., Roth, A., Roughgarden, T., and Ullman, J. (2014). Privately solving linear programs. In International Colloquium on Automata, Languages, and Programming, pages 612\u2013624. Springer.","DOI":"10.1007\/978-3-662-43948-7_51"},{"key":"7199_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119199","volume":"642","author":"J Hu","year":"2023","unstructured":"Hu, J., Chen, G., Li, H., Huang, T., & Ran, L. (2023). Achieving linear convergence for differentially private full-decentralized economic dispatch over directed networks. Inf. Sci., 642, Article 119199.","journal-title":"Inf. Sci."},{"key":"7199_CR39","doi-asserted-by":"crossref","unstructured":"Huang, Z., Mitra, S., and Vaidya, N. (2015). Differentially private distributed optimization. In Proceedings of the 2015 International Conference on Distributed Computing and Networking, page\u00a04. ACM.","DOI":"10.1145\/2684464.2684480"},{"issue":"1","key":"7199_CR40","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/msom.1120.0400","volume":"15","author":"K Hyndman","year":"2013","unstructured":"Hyndman, K., Kraiselburd, S., & Watson, N. (2013). Aligning capacity decisions in supply chains when demand forecasts are private information: Theory and experiment. Manufacturing & Service Operations Management, 15(1), 102\u2013117.","journal-title":"Manufacturing & Service Operations Management"},{"key":"7199_CR41","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T Ibaraki","year":"1988","unstructured":"Ibaraki, T., & Katoh, N. (1988). Resource Allocation Problems: Algorithmic Approaches. Cambridge, MA, USA: MIT Press."},{"key":"7199_CR42","unstructured":"Ji, Z., Lipton, Z.\u00a0C., and Elkan, C. (2014). Differential privacy and machine learning: a survey and review. arXiv:1412.7584. (accessed on 20 February 2025)."},{"issue":"2","key":"7199_CR43","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.ejor.2022.11.025","volume":"308","author":"U Karaca","year":"2023","unstructured":"Karaca, U., \u0130lker Birbil, S., Ayd\u0131n, N., & Mullao\u011flu, G. (2023). Masking primal and dual models for data privacy in network revenue management. Eur. J. Oper. Res., 308(2), 818\u2013831.","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"7199_CR44","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"SP Kasiviswanathan","year":"2011","unstructured":"Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011). What can we learn privately? SIAM J. Comput., 40(3), 793\u2013826.","journal-title":"SIAM J. Comput."},{"key":"7199_CR45","unstructured":"Kearns, M., Pai, M.\u00a0M., Rogers, R.\u00a0M., Roth, A., and Ullman, J. (2015). Robust mediators in large games. arXiv:1512.02698. (accessed on 20 February 2025)."},{"issue":"5","key":"7199_CR46","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1257\/aer.104.5.431","volume":"104","author":"M Kearns","year":"2014","unstructured":"Kearns, M., Pai, M. M., Roth, A., & Ullman, J. (2014). Mechanism design in large games: Incentives and privacy. Am. Econ. Rev., 104(5), 431\u2013435.","journal-title":"Am. Econ. Rev."},{"key":"7199_CR47","unstructured":"Kone\u010dn\u1ef3, J., McMahan, H.\u00a0B., Ramage, D., and Richt\u00e1rik, P. (2016). Federated optimization: Distributed machine learning for on-device intelligence. arXiv:1610.02527. (accessed on 20 February 2025)."},{"issue":"2","key":"7199_CR48","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ijpe.2012.01.001","volume":"143","author":"A Kov\u00e1cs","year":"2013","unstructured":"Kov\u00e1cs, A., Egri, P., Kis, T., & V\u00e1ncza, J. (2013). Inventory control in supply chains: Alternative approaches to a two-stage lot-sizing problem. Int. J. Prod. Econ., 143(2), 385\u2013394.","journal-title":"Int. J. Prod. Econ."},{"issue":"2","key":"7199_CR49","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1137\/20M1355847","volume":"32","author":"N Kuru","year":"2022","unstructured":"Kuru, N., Birbil, \u015e\u0130, G\u00fcrb\u00fczbalaban, M., & Y\u0131ld\u0131r\u0131m, S. (2022). Differentially private accelerated optimization algorithms. SIAM J. Optim., 32(2), 795\u2013821.","journal-title":"SIAM J. Optim."},{"key":"7199_CR50","doi-asserted-by":"crossref","unstructured":"Kutanoglu, E., David, W., & S. (1999). On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Trans.,31(9), 813\u2013826.","DOI":"10.1080\/07408179908969883"},{"issue":"4","key":"7199_CR51","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1287\/trsc.2018.0870","volume":"53","author":"M Lai","year":"2019","unstructured":"Lai, M., Xue, W., & Hu, Q. (2019). An ascending auction for freight forwarder collaboration in capacity sharing. Transp. Sci., 53(4), 1175\u20131195.","journal-title":"Transp. Sci."},{"key":"7199_CR52","doi-asserted-by":"crossref","unstructured":"Lei, Y., Miao, S., and Momot, R. (2023). Privacy-preserving personalized revenue management. Management Science.","DOI":"10.1287\/mnsc.2023.4925"},{"issue":"3","key":"7199_CR53","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MSP.2020.2975749","volume":"37","author":"T Li","year":"2020","unstructured":"Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020). Federated learning: Challenges, methods, and future directions. IEEE Signal Process. Mag., 37(3), 50\u201360.","journal-title":"IEEE Signal Process. Mag."},{"issue":"1","key":"7199_CR54","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s11590-011-0403-2","volume":"7","author":"W Li","year":"2013","unstructured":"Li, W., Li, H., & Deng, C. (2013). Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optimization Letters, 7(1), 137\u2013144.","journal-title":"Optimization Letters"},{"issue":"1","key":"7199_CR55","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11590-010-0199-5","volume":"5","author":"OL Mangasarian","year":"2011","unstructured":"Mangasarian, O. L. (2011). Privacy-preserving linear programming. Optimization Letters, 5(1), 165\u2013172.","journal-title":"Optimization Letters"},{"issue":"3","key":"7199_CR56","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s11590-010-0268-9","volume":"6","author":"OL Mangasarian","year":"2012","unstructured":"Mangasarian, O. L. (2012). Privacy-preserving horizontally partitioned linear programs. Optimization Letters, 6(3), 431\u2013436.","journal-title":"Optimization Letters"},{"key":"7199_CR57","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., and y\u00a0Arcas, B.\u00a0A. (2017). Communication-efficient learning of deep networks from decentralized data. In Artificial Intelligence and Statistics, pages 1273\u20131282. PMLR."},{"key":"7199_CR58","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.future.2020.10.007","volume":"115","author":"V Mothukuri","year":"2021","unstructured":"Mothukuri, V., Parizi, R. M., Pouriyeh, S., Huang, Y., Dehghantanha, A., & Srivastava, G. (2021). A survey on security and privacy of federated learning. Futur. Gener. Comput. Syst., 115, 619\u2013640.","journal-title":"Futur. Gener. Comput. Syst."},{"key":"7199_CR59","unstructured":"Narayanan, A. and Shmatikov, V. (2006). How to break anonymity of the Netflix prize dataset. arXiv:0610105. (accessed on 20 February 2025)."},{"issue":"1","key":"7199_CR60","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1111\/j.1937-5956.2004.tb00148.x","volume":"13","author":"S Poundarikapuram","year":"2004","unstructured":"Poundarikapuram, S., & Veeramani, D. (2004). Distributed decision-making in supply chains and private e-marketplaces. Prod. Oper. Manag., 13(1), 111\u2013121.","journal-title":"Prod. Oper. Manag."},{"issue":"1","key":"7199_CR61","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-024-05917-6","volume":"337","author":"D P\u00e9rez-Perales","year":"2024","unstructured":"P\u00e9rez-Perales, D., Boza, A., Alarc\u00f3n, F., & G\u00f3mez-Gasquet, P. (2024). Mathematical programming-based methodology for the evaluation of supply chain collaborative planning scenarios. Ann. Oper. Res., 337(1), 261\u2013312.","journal-title":"Ann. Oper. Res."},{"key":"7199_CR62","doi-asserted-by":"crossref","unstructured":"Rogers, R.\u00a0M. and Roth, A. (2014). Asymptotically truthful equilibrium selection in large congestion games. In Proceedings of the Fifteenth ACM Conference on Economics and Computation, page 771\u2013782, New York, NY, USA. Association for Computing Machinery.","DOI":"10.1145\/2600057.2602856"},{"key":"7199_CR63","doi-asserted-by":"crossref","unstructured":"Ryu, J.\u00a0R., Zheng, Y., Gao, Y., Abuadbba, A., Kim, J., Won, D., Nepal, S., Kim, H., and Wang, C. (2022). Can differential privacy practically protect collaborative deep learning inference for IoT? Wireless Networks.","DOI":"10.1007\/s11276-022-03113-7"},{"key":"7199_CR64","doi-asserted-by":"crossref","unstructured":"Shokri, R. and Shmatikov, V. (2015). Privacy-preserving deep learning. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pages 1310\u20131321.","DOI":"10.1145\/2810103.2813687"},{"issue":"3","key":"7199_CR65","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.ejor.2016.08.032","volume":"264","author":"MG Speranza","year":"2018","unstructured":"Speranza, M. G. (2018). Trends in transportation and logistics. Eur. J. Oper. Res., 264(3), 830\u2013836.","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"7199_CR66","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1111\/j.1748-720X.1997.tb01885.x","volume":"25","author":"L Sweeney","year":"1997","unstructured":"Sweeney, L. (1997). Weaving technology and policy together to maintain confidentiality. The Journal of Law, Medicine & Ethics, 25(2\u20133), 98\u2013110.","journal-title":"The Journal of Law, Medicine & Ethics"},{"key":"7199_CR67","doi-asserted-by":"crossref","unstructured":"Toft, T. (2009). Solving linear programs using multiparty computation. In Dingledine, R. and Golle, P., editors, Financial Cryptography and Data Security, pages 90\u2013107, Berlin, Heidelberg. Springer.","DOI":"10.1007\/978-3-642-03549-4_6"},{"issue":"5","key":"7199_CR68","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1057\/rpm.2012.8","volume":"11","author":"H Topaloglu","year":"2012","unstructured":"Topaloglu, H. (2012). A duality based approach for network revenue management in airline alliances. Journal of Revenue and Pricing Management, 11(5), 500\u2013517.","journal-title":"Journal of Revenue and Pricing Management"},{"key":"7199_CR69","unstructured":"Toyota (2006). Fuji Heavy Industries\u2019 U.S. plant to build Toyota Camry. https:\/\/global.toyota\/en\/newsroom\/corporate\/25607796.html (accessed on 20 February 2025)."},{"key":"7199_CR70","doi-asserted-by":"crossref","unstructured":"Tran, A., Luong, T., and Pham, X. (2024). Privacy-preserving deep learning model with integer quantization and secure multi-party computation. Annals of Operations Research.","DOI":"10.1007\/s10479-024-06151-w"},{"key":"7199_CR71","doi-asserted-by":"crossref","unstructured":"Vaidya, J. (2009). Privacy-preserving linear programming. In Proceedings of the 2009 ACM Symposium on Applied Computing, pages 2002\u20132007. ACM.","DOI":"10.1145\/1529282.1529729"},{"issue":"6","key":"7199_CR72","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1080\/01441647.2013.853706","volume":"33","author":"L Verdonck","year":"2013","unstructured":"Verdonck, L., Caris, A., Ramaekers, K., & Janssens, G. K. (2013). Collaborative logistics from the perspective of road transportation companies. Transp. Rev., 33(6), 700\u2013719.","journal-title":"Transp. Rev."},{"key":"7199_CR73","volume-title":"Advances in Neural Information Processing Systems","author":"D Wang","year":"2017","unstructured":"Wang, D., Ye, M., & Xu, J. (2017). Differentially private empirical risk minimization revisited: Faster and more general. In I. Guyon, U. V. Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, & R. Garnett (Eds.), Advances in Neural Information Processing Systems.  (Vol. 30). Curran Associates Inc."},{"key":"7199_CR74","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.127986","volume":"597","author":"Y Wang","year":"2024","unstructured":"Wang, Y., Lin, H., Lam, J., & Kwok, K.-W. (2024). Differentially private consensus and distributed optimization in multi-agent systems: A review. Neurocomputing, 597, Article 127986.","journal-title":"Neurocomputing"},{"issue":"1","key":"7199_CR75","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/trsc.1090.0300","volume":"44","author":"CP Wright","year":"2010","unstructured":"Wright, C. P., Groenevelt, H., & Shumsky, R. A. (2010). Dynamic revenue management in airline alliances. Transp. Sci., 44(1), 15\u201337.","journal-title":"Transp. Sci."},{"key":"7199_CR76","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2023.103827","volume":"89","author":"M Yang","year":"2024","unstructured":"Yang, M., Guo, T., Zhu, T., Tjuawinata, I., Zhao, J., & Lam, K.-Y. (2024). Local differential privacy and its applications: A comprehensive survey. Computer Standards & Interfaces, 89, Article 103827.","journal-title":"Computer Standards & Interfaces"},{"issue":"2","key":"7199_CR77","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019). Federated machine learning: Concept and applications. ACM Transactions on Intelligent Systems and Technology (TIST), 10(2), 1\u201319.","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"issue":"1","key":"7199_CR78","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TIFS.2016.2607691","volume":"12","author":"T Zhang","year":"2017","unstructured":"Zhang, T., & Zhu, Q. (2017). Dynamic differential privacy for admm-based distributed classification learning. IEEE Trans. Inf. Forensics Secur., 12(1), 172\u2013187.","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"7199_CR79","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1109\/TPWRS.2023.3246998","volume":"39","author":"D Zhao","year":"2024","unstructured":"Zhao, D., Liu, D., & Liu, L. (2024). Distributed privacy preserving algorithm for economic dispatch over time-varying communication. IEEE Trans. Power Syst., 39(1), 643\u2013657.","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"7199_CR80","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TSIPN.2018.2797806","volume":"4","author":"J Zhu","year":"2018","unstructured":"Zhu, J., Xu, C., Guan, J., & Wu, D. O. (2018). Differentially private distributed online algorithms over time-varying directed networks. IEEE Transactions on Signal and Information Processing over Networks, 4(1), 4\u201317.","journal-title":"IEEE Transactions on Signal and Information Processing over Networks"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-026-07199-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-026-07199-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-026-07199-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T21:03:08Z","timestamp":1778187788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-026-07199-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,17]]},"references-count":80,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["7199"],"URL":"https:\/\/doi.org\/10.1007\/s10479-026-07199-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,17]]},"assertion":[{"value":"25 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}