A survey of privacy-aware supply chain collaboration: From theory to applications

Journal of Information Systems

Volumn 28, Issue 1, 2014, Pages 243-268

  Hong, Yuan ^a   Vaidya, Jaideep ^b   Wang, Shengbin ^c  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c NORTH CAROLINA A AND T STATE UNIVERSITY   (United States)

Author keywords

Optimization; Privacy; Supply chain management

Indexed keywords

EID: 84903184001     PISSN: 08887985     EISSN: 15587959     Source Type: Journal    
DOI: 10.2308/isys-50692     Document Type: Article

References (104)

1. Agrawal, R., and R. Srikant. 2000. Privacy-preserving data mining. In Proceedings of the ACM SIGMOD Conference on Management of Data, 439-450, Dallas, TX. Available at: http://dl.acm.org/citation. cfm?doid=342009.335438
2. Atallah, M. J., V. Deshpande, H. G. Elmongui, and L. B. Schwarz. 2003. Secure supply-chain protocols. In Proceedings of the 2003 IEEE International Conference on E-Commerce. Available at: http:// citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.158.4346&rep=rep1&type=pdf
3. Atallah, M. J., V. Deshpande, E. K. B. Frikken, and L. B. Schwarz. 2004. Secure supply-chain collaboration. Available at: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.5111
4. Atallah, M. J., M. Blanton, E. K. B. Frikken, and J. Li. 2006. Efficient correlated action selection. In Proceedings of Financial Cryptography, 296-310. Available at: https://www.cs.purdue.edu/homes/ mja/sscc/documents/fc06-slides.pdf
5. Awerbuch, B., and Y. Azar. 1994. Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation. In Proceedings of IEEE Symposium on Foundations of Computer Science, 240-249. Available at: http://www.cs.tau.ac.il/;azar/conc.pdf
6. Baltzan, P. 2011. Business Driven Information Systems. Boston, MA: McGraw-Hill/Irwin.
7. Bandyopadhyay, T., V. S. Jacob, and S. Raghunathan. 2010. Information security in networked supply chains: Impact of network vulnerability and supply chain integration on incentives to invest. Information Technology and Management 11 (1): 7-23.
8. Barany, I. 1992. Fair distribution protocols or how the players replace fortune. Mathematics of Operations Research 17 (2): 327-340.
9. Bartal, Y., J. W. Byers, and D. Raz. 2004. Fast, distributed approximation algorithms for positive linear programming with applications to flow control. SIAM Journal on Computing 33 (6): 1261-1279.
10. Bednarz, A., N. Bean, and M. Roughan. 2009. Hiccups on the road to privacy-preserving linear programming. In Proceedings of the 8th ACM Workshop on Privacy in the Electronic Society, 117-120. Available at: http://www.maths.adelaide.edu.au/matthew.roughan/Papers/p117-bednarz.pdf
11. Bednarz, A. 2012. Methods for Two-Party Privacy-Preserving Linear Programming. Ph.D. thesis, University of Adelaide.
12. Ben-Or, M., R. Canetti, and O. Goldreich. 1993. Asynchronous secure computation. In Proceedings of Twenty-Fifth Annual ACM Symposium on Theory of Computing, 52-61. Available at: http://dl.acm. org/citation.cfm?id=167088.167109
13. Ben-Or, M., S. Goldwasser, and A. Wigderson. 1998. Completeness theorems for non-cryptographic faulttolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1-10. Available at: http://www.researchgate.net/publication/221590203_Completeness_ Theorems_for_Non-Cryptographic_Fault-Tolerant_Distributed_Computation_%28Extended_ Abstract%29
14. Ben-Porath, E. 1998. Correlation without mediation: Expanding the set of equilibrium outcomes by "cheap" pre-play procedures. Journal of Economic Theory 80 (1): 108-122.
15. Benaloh, J., and D. Tuinstra. 1994. Receipt-free secret-ballot elections (extended abstract). In STOC '94: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 544-553. Available at: http://www.researchgate.net/publication/221591588_Receipt-free_secret-ballot_ elections_%28extended_abstract%29
16. Brailsford, S. C., C. N. Potts, and B. M. Smith. 1999. Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research 119 (3): 557-581.
17. Buss, D. 2003. Case study: Land O'Lakes and collaborative logistics. Available at: http://www.cioinsight. com/c/a/Case-Studies/Case-Study-Land-OLakes-and-Collaborative-Logistics/
18. Cachon, G. P., and F. Zhang. 2006. Procuring fast delivery: Sole sourcing with information asymmetry. Management Science 52 (6): 881-896.
19. Canetti, R., and R. Gennaro. 1996. Incoercible multiparty computation. In FOCS '96: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 504. Available at: http://www. researchgate.net/publication/3671942_Incoercible_multiparty_computation
20. Canetti, R., Y. Lindell, R. Ostrovsky, and A. Sahai. 2002. Universally composable two-party and multiparty secure computation. In STOC '02: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, 494-503. Available at: http://www.cs.ucla.edu/;rafail/PUBLIC/57.pdf
21. Canetti, R., E. Kushilevitz, and Y. Lindell. 2006. On the limitations of universally composable two-party computation without set-up assumptions. Journal of Cryptology 19 (2): 135-167. An extended abstract appeared in Eurocrypt 2003. New York, NY: Springer-Verlag (LNCS 2656), 68-86.
22. Catrina, O., and S. de Hoogh. 2010. Secure multiparty linear programming using fixed-point arithmetic. In Proceedings of the 15th European Symposium on Research in Computer Security, 134-150. Available at: http://dl.acm.org/citation.cfm?id=1888893
23. Chaum, D., C. Crepeau, and I. Damgard. 1988. Multiparty unconditionally secure protocols. In STOC '88: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 11-19. Available at: http://dl.acm.org/citation.cfm?id=62214
24. Chen, S., C. Wang, D. Liu, and G. Singh. 2011. Secure multi-party collaboration systems in supply chain management. In Proceedings of the 1st International Conference on Logistics, Informatics and Service Science, 105-107. Available at: http://www.researchgate.net/publication/221251905_ Secure_Multi-party_Collaboration_Systems_in_Supply_Chain_Management
25. Clifton, C., A. Iyer, R. Cho, W. Jiang, M. Kantarcioglu, and J. Vaidya. 2008. An approach to identifying beneficial collaboration securely in decentralized logistics systems. Manufacturing & Service Operations Management 10 (1): 108-125.
26. Dantzig, G. 1963. Linear Programming and Extensions. Princeton, NJ: Princeton University Press.
27. Daughety, A., and J. Reinganum. 2007. Competition and confidentiality: Signaling quality in a duopoly when there is universal private information. Games and Economic Behavior 58 (1): 94-120.
28. Deshpande, V., and L. B. Schwarz. 2005. Optimal Capacity Choice and Allocation in Decentralized Supply Chains. Working paper, Purdue University.
29. Deshpande, V., L. Schwarz, M. Atallah, M. Blanton, and K. Frikken. 2011. Outsourcing manufacturing: Secure price-masking mechanisms for purchasing component parts. Production and Operations Management 20 (2): 165-180.
30. Dodis, Y., S. Halevi, and T. Rabin. 2000. A cryptographic solution to a game theoretic problem. In CRYPTO '00: Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology, 112-130. Available at: http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.106. 3670
31. Dreier, J., and F. Kerschbaum. 2011. Practical privacy-preserving multi-party linear programming based on problem transformation. In Proceedings of the Third IEEE International Conference on Privacy, Security, Risk and Trust, 916-924. Available at: http://ieeexplore.ieee.org/xpl/articleDetails.jsp? arnumber=6113241
32. Du, W. 2001. A Study of Several Specific Secure Two-Party Computation Problems. Ph.D. thesis. West Lafayette, IN: Purdue University.
33. Dwork, C. 2008. Differential privacy: A survey of results. Theory and Applications of Models of Computation 4978: 1-19.
34. Evfimievski, A., R. Srikant, R. Agrawal, and J. Gehrke. 2002. Privacy preserving mining of association rules. In Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 217-228. Available at: http://citeseerx.ist.psu.edu/viewdoc/summary? doi=10.1.1.19.3747
35. Fischer, M., and R. Wright. 1993. An application of game theoretic techniques to cryptography. Discrete Mathematics and Theoretical Computer Science 13: 99-118.
36. Gal-Or, E., and A. Ghose. 2005. The economic incentives for sharing security information. Information Systems Research 16 (2): 186-208.
37. Gerardi, D. 2004. Unmediated communication in games with complete and incomplete information. Journal of Economic Theory 114 (1): 104-131.
38. Goldreich, O., S. Micali, and A. Wigderson. 1987. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the 19th ACM Symposium on Theory of Computing, 218-229. Available at: http://www.bibsonomy.org/bibtex/211382b846bc9c7535d 37daf703a9a00f/danfunky
39. Goldreich, O. 2004. Chapter 5: Encryption schemes. In The Foundations of Cryptography, Volume 2. Cambridge, MA: Cambridge University Press.
40. Goldwasser, S., and L. A. Levin. 1991. Fair computation of general functions in presence of immoral majority. In CRYPTO '90: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, 77-93. New York, NY: Springer-Verlag. Available at: http://www. researchgate.net/publication/221355525_Fair_Computation_of_General_Functions_in_Presence_of_ Immoral_Majority
41. He, X., J. Vaidya, B. Shafiq, N. R. Adam, and V. Atluri. 2009. Preserving privacy in social networks: A structure-aware approach. In Proceedings of the 8th International Conference on Web Intelligence, 647-654. Available at: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5284903
42. Hong, Y., X. He, J. Vaidya, N. R. Adam, and V. Atluri. 2009. Effective anonymization of query logs. In Proceedings of the 18th ACM Conference on Information and Knowledge Management, 1465-1468. Available at: http://dl.acm.org/citation.cfm?doid=1645953.1646146
43. Hong, Y., J. Vaidya, and H. Lu. 2011a. Efficient distributed linear programming with limited disclosure. In Proceedings of the 25th Annual IFIP WG 1.3 Conference on Data and Applications Security and Privacy, 170-185. Available at: http://dl.acm.org/citation.cfm?id=2029917
44. Hong, Y., J. Vaidya, H. Lu, and B. Shafiq. 2011b. Privacy-preserving tabu search for distributed graph coloring. In Proceedings of the Third IEEE International Conference on Privacy, Security, Risk and Trust, 951-958. Available at: http://www.bibsonomy.org/bibtex/2aa159b42f383bea482fb 0cb469eff030/dblp
45. Hong, Y., J. Vaidya, and H. Lu. 2012a. Secure and efficient distributed linear programming. Journal of Computer Security 20 (5): 583-634.
46. Hong, Y., J. Vaidya, H. Lu, and M. Wu. 2012b. Differentially private search log sanitization with optimal output utility. In Proceedings of the 15th International Conference on Extending Database Technology, 50-61. Available at: http://www.bibsonomy.org/bibtex/24e11f0441865a8c682d 51f2ea307bc29/dblp
47. Hong, Y. 2013. Privacy-Preserving Collaborative Optimization. Ph.D. thesis, Rutgers, The State University of New Jersey.
48. Hong, Y., and J. Vaidya. 2013a. An inference-proof approach to privacy-preserving horizontally partitioned linear programs. Optimization Letters 8 (1): 267-277.
49. Hong, Y., and J. Vaidya. 2013b. Secure transformation for multiparty linear programming. Rutgers Technical Report. Available at: http://www.albany.edu/faculty/hong/pub/SecTran.pdf
50. Kantarcioglu, M., J. Jin, and C. Clifton. 2004. When do data mining results violate privacy? In Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 599-604. Available at: http://dl.acm.org/citation.cfm?doid=1014052.1014126
51. Kayis, E., F. Erhun, and E. L. Plambeck. 2013. Delegation vs. control of component procurement under asymmetric cost information and simple contracts. Manufacturing and Service Operations Management 15 (1): 45-56.
52. Kim, S. H., and S. Netessine. 2013. Collaborative cost reduction and component procurement under information asymmetry. Management Science 59 (1): 189-206.
53. Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220 (4598): 671-680.
54. Kushilevitz, E., Y. Lindell, and T. Rabin. 2006. Information-theoretically secure protocols and security under composition. In STOC '06: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, 109-118. Available at: http://dl.acm.org/citation.cfm?id=1132532
55. Lepinski, M., S. Micali, C. Peikert, and A. Shelat. 2004. Completely fair SFE and coalition-safe cheap talk. In PODC '04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 1-10. Available at: http://dl.acm.org/citation.cfm?id=1011769
56. Li, C., and L. G. Debo. 2009. Second sourcing vs. sole sourcing with capacity investment and asymmetric information. Manufacturing & Service Operations Management 11 (3): 448-470.
57. Li, J., and M. J. Atallah. 2006. Secure and private collaborative linear programming. In Proceedings of the 2nd International Conference on Collaborative Computing: Networking, Applications and Worksharing, 1-8. Available at: http://www.researchgate.net/publication/224704468_Secure_and_ Private_Collaborative_Linear_Programming
58. Li, L., and H. Zhang. 2008. Confidentiality and information sharing in supply chain coordination. Management Science 54 (8): 1467-1481.
59. Li, W., H. Li, and C. Deng. 2013. Privacy-preserving horizontally partitioned linear programs with inequality constraints. Optimization Letters 7 (1): 137-144.
60. Lim, W. S. 2001. Producer-supplier contracts with incomplete information. Management Science 47 (5): 709-715.
61. Lin, X., C. Clifton, and M. Zhu. 2005. Privacy preserving clustering with distributed EM mixture modeling. Knowledge and Information Systems 8 (1): 68-81.
62. Lindell, Y., A. Lysyanskaya, and T. Rabin. 2002. On the composition of authenticated byzantine agreement. In STOC '02: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, 514-523. Available at: http://dl.acm.org/citation.cfm?id=509982&CFID=403945105& CFTOKEN=15350398
63. Lindell, Y. 2003a. Composition of Secure Multi-Party Protocols-A Comprehensive Study, Volume 2815 of Lecture Notes in Computer Science. New York, NY: Springer-Verlag.
64. Lindell, Y. 2003b. General composition and universal composability in secure multiparty computation. In Proceedings of the 44th Symposium on Foundations of Computer Science, 394-403. Available at: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=1238213
65. Mailler, R., and V. Lesser. 2004. Solving distributed constraint optimization problems using cooperative mediation. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 438-445. Available at: http://dl.acm.org/citation.cfm?id=1018777
66. Mangasarian, O. L. 2011. Privacy-preserving linear programming. Optimization Letters 5 (1): 165-172.
67. Mangasarian, O. L. 2012. Privacy-preserving horizontally partitioned linear programs. Optimization Letters 6 (3): 431-436.
68. Matsuura, K. 2003. Information security and economics in computer networks: An interdisciplinary survey and a proposal of integrated optimization of investment. In Proceedings of the 9th International Conference of Computing in Economics and Finance. Available at: http://depts.washington.edu/ sce2003/Papers/48.pdf
69. Meixell, M. J., and M. Norbis. 2012. Integrating carrier selection with supplier selection decisions to improve supply chain security. International Transactions in Operations Research 19 (5): 711-732.
70. Mielikainen, T. 2004. Privacy problems with anonymized transaction databases. In Discovery Science: 7th International Conference Proceedings, Lecture Notes in Computer Science, Volume 3245, 219-229. New York, NY: Springer-Verlag.
71. Miller, A. R., and C. Tucker. 2009. Privacy protection and technology diffusion: The case of electronic medical records. Management Science 55 (7): 1077-1093.
72. Modi, P. J., W-M. Shen, M. Tambe, and M. Yokoo. 2003. An asynchronous complete method for distributed constraint optimization. In AAMAS '03: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, 161-168. Available at: http://teamcore. usc.edu/papers/2003/modi-aamas03.pdf
73. Ostrovsky, R., and M. Yung. 1991. How to withstand mobile virus attacks (extended abstract). In PODC '91: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 51-59. Available at: http://dl.acm.org/citation.cfm?doid=112600.112605
74. Özener, Ö., and Ö. Ergun 2008. Allocating costs in a collaborative transportation procurement network. Transportation Science 42 (2): 146-165.
75. Papadimitriou, C. H., and K. Steiglitz. 1982. Combinatorial Optimization: Algorithms and Complexity. Upper Saddle River, NJ: Prentice-Hall.
76. Papadimitriou, C. H., and M. Yannakakis. 1991. On the value of information in distributed decision-making (extended abstract). In PODC '91: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 61-64. Available at: http://dl.acm.org/citation.cfm?id=112606
77. Papadimitriou, C. H., and M. Yannakakis. 1993. Linear programming without the matrix. In STOC '93: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 121-129. Available at: http://dl.acm.org/citation.cfm?id=167127
78. Petcu, A., and B. Faltings. 2005a. Approximations in distributed optimization. In Proceedings of CP05-Workshop on Distributed and Speculative Constraint Processing (DSCP). Available at: http://link. springer.com/chapter/10.1007%2F11564751_68
79. Petcu, A., and B. Faltings. 2005b. An efficient constraint optimization method for large multiagent systems. In Proceedings of AAMAS05-LSMAS Workshop. Available at: http://citeseerx.ist.psu.edu/viewdoc/ summary?doi=10.1.1.385.5116
80. Petcu, A., and B. Faltings. 2005c. Incentive compatible multiagent constraint optimization. In Proceedings of WINE'05: Workshop on Internet and Network Economics. Available at: http://citeseer.ist.psu.edu/ viewdoc/summary;jsessionid=BBADCA8B49538E3E4BE6244CEDC970D8?doi=10.1.1.385.9181
81. Petcu, A., and B. Faltings. 2005d. Optimal solution stability in continuous time optimization. In Proceedings of IJCAI05-Distributed Constraint Reasoning Workshop (DCR05). Available at: http:// citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.5650
82. Petcu, A., and B. Faltings. 2005e. A scalable method for multiagent constraint optimization. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), 266-271. Available at: http://dl.acm.org/citation.cfm?id=1642336
83. Petcu, A., and B. Faltings. 2005f. Superstabilizing, fault-containing multiagent combinatorial optimization. In Proceedings of the National Conference on Artificial Intelligence (AAAI-05), 449-454. Available at: https://www.aaai.org/Papers/AAAI/2005/AAAI05-071.pdf
84. Petcu, A., and B. Faltings. 2006. Distributed generator maintenance scheduling. In Proceedings of the First International ICSC Symposium on Artificial Intelligence in Energy Systems and Power (AIESP-06). Available at: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.386.870&rep=rep 1&type=pdf
85. Ren, Z. J., M. A. Cohen, T. H. Ho, and C. Terwiesch. 2010. Information sharing in a long-term supply chain relationship: The role of customer review strategy. Operations Research 58 (1): 81-93.
86. Sakuma, J., and S. Kobayashi. 2007. A genetic algorithm for privacy preserving combinatorial optimization. In Proceedings of 2007 Genetic and Evolutionary Computation Conference, 1372-1379. Available at: http://dl.acm.org/citation.cfm?doid=1276958.1277214
87. Silaghi, M. C., and D. Mitra. 2004. Distributed constraint satisfaction and optimization with privacy enforcement. In Proceedings of IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 531-535. Available at: http://ieeexplore.ieee.org/xpl/articleDetails.jsp? arnumber=1343012
88. Silaghi, M. C., and V. Rajeshirke. 2004. The effect of policies for selecting the solution of a DisCSP on privacy loss. In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 1396-1397. Available at: http://www.computer.org/csdl/proceedings/aamas/ 2004/2092/03/20921396.pdf
89. Silaghi, M. C., B. Faltings, and A. Petcu. 2006. Secure combinatorial optimization simulating DFS treebased variable elimination. In Proceedings of the 9th Symposium on Artificial Intelligence and Mathematics. Available at: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.4234
90. Smith, G. E., K. J. Watson, W. H. Baker, and J. A. Pokorski II. 2007. A critical balance: Collaboration and security in the IT-enabled supply chain. International Journal of Production Research 45 (11): 2595-2613.
91. Suzuki, K., and M. Yokoo. 2003. Secure generalized Vickrey auction using homomorphic encryption. Financial Cryptography 2742: 239-249.
92. Sweeney, L. 2002. K-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems 10 (5): 557-570.
93. Teague, V. 2004. Selecting correlated random actions. In Proceedings of Financial Cryptography, 181-195. Available at: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.1791
94. Turban, E., R. K. Rainer, and R. E. Potter. 2005. Chapter 2: Information technologies: Concepts and management. In Introduction to Information Technology. 3rd Edition. New York, NY: John Wiley and Sons.
95. Vaidya, J., and C. Clifton. 2003. Privacy-preserving k-means clustering over vertically partitioned data. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 206-215. Available at: http://dl.acm.org/citation.cfm?id=956776
96. Vaidya, J. 2009a. Privacy-preserving linear programming. In Proceedings of the 24th Annual ACM Symposium on Applied Computing, 2002-2007. Available at: http://dl.acm.org/citation.cfm? id=1529729&CFID=403945105&CFTOKEN=15350398
97. Vaidya, J. 2009b. A secure revised simplex algorithm for privacy-preserving linear programming. In AINA '09: Proceedings of the 23rd IEEE International Conference on Advanced Information Networking and Applications, 347-354. Available at: http://ieeexplore.ieee.org/xpl/articleDetails.jsp? arnumber=5076220
98. Yao, A. C. 1986. How to generate and exchange secrets. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 162-167. Available at: http://dl.acm.org/citation.cfm?id=1382944
99. Yokoo, M., E. H. Durfee, T. Ishida, and K. Kuwabar. 1992. Distributed constraint satisfaction for formalizing distributed problem solving. In In Proceedings of International Conference on Distributed Computing Systems, 614-621. Available at: http://ieeexplore.ieee.org/xpl/articleDetails. jsp?arnumber=235101
100. Yokoo, M., and K. Hirayama. 1995. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In Proceedings of the First International Conference on Multi-Agent Systems, edited by Lesser, V. Cambridge, MA: MIT Press.
101. Yokoo, M., K. Suzuki, and K. Hirayama. 2002. Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP-2002), 387-401. Available at: http://www.researchgate.net/publication/221633421_Secure_Distributed_Constraint_ Satisfaction_Reaching_Agreement_without_Revealing_Private_Information
102. Zeng, Y., L. Wang, X. Deng, X. Cao, and N. Khundker. 2012. Secure collaboration in global design and supply chain environment: Problem analysis and literature review. Computers in Industry 63 (6): 545-556.
103. Zhang, W., and L. Wittenburg. 2003. Distributed breakout algorithm for distributed constraint optimization problems-DBArelax. In Proceedings of the International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-03), 1158-1159. Available at: http://dl.acm.org/citation.cfm? doid=860575.860844
104. Zhang, W., D. Zhou, and L. Liu. 2010. Procurement control against supply chain upstream risk and inefficiency. Available at: http://ssrn.com/abstract=1537826