Semiring-based frameworks for trust propagation in small-world networks and coalition formation criteria

Security and Communication Networks

Volumn 3, Issue 6, 2010, Pages 595-610

  Bistarelli, S ^a,b,c   Foley, S N ^d   O'Sullivan, B ^d   Santini, F ^b,c,e  

^a UNIVERSITY OF PERUGIA   (Italy)

^b CNR   (Italy)

^c UNIVERSITY OF CHIETI   (Italy)

^d UNIVERSITY COLLEGE CORK   (Ireland)

^e IMT Scuola di Studi Avanzati Lucca   (Italy)

Author keywords

And or graphs; Soft constraint logic programming; Trust network; Trust propagation

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT SATISFACTION PROBLEMS; LOGIC PROGRAMMING; SMALL-WORLD NETWORKS;

AND-OR GRAPHS; COALITION FORMATIONS; DEGREE OF TRUSTS; SOFT CONSTRAINT; SOFT CONSTRAINT SATISFACTION; TRUST AGGREGATIONS; TRUST NETWORKS; TRUST PROPAGATION;

CONSTRAINT THEORY;

EID: 84872090386     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.252     Document Type: Article

References (48)

1. Klusch M, Gerber A. Dynamic coalition formation among rational agents. IEEE Intelligent Systems 2002; 17: 42-47. DOI: http://doi.ieeecomputersociety.org/10.1109/MIS.2002.1005630
2. Ziegler CN, Lausen G. Propagation models for trust and distrust in social networks. Information Systems Frontiers 2005; 7(4-5): 337-358. DOI: http://dx.doi.org/10.1007/s10796-005-4807-3
3. Theodorakopoulos G, Baras JS. Trust evaluation in ad-hoc networks. WiSe '04: Workshop on Wireless security, ACM, 2004; 1-10. DOI: http://doi.acm.org/10.1145/1023646.1023648
4. Bistarelli S, Santini F. Propagating multitrust within trust networks, In SAC, Wainwright RL, Haddad H (eds). ACM: New York, NY, USA, 2008; 1990-1994.
5. Martelli A, Montanari U. Optimizing decision trees through heuristically guided search. Communication of the ACM 1978; 21(12): 1025-1039. DOI: http://doi.acm.org/10.1145/359657.359664
6. Bistarelli S. Semirings for Soft Constraint Solving and Programming, Vol. 2962, LNCS. Springer: New York, NY, USA, 2004.
7. Bistarelli S, Montanari U, Rossi F. Semiring-based constraint logic programming. Proceedings of IJCAI97, Morgan Kaufman, 1997; 352-357.
8. Bistarelli S, Montanari U, Rossi F. Semiring-based constraint solving and optimization. Journal of the ACM 1997; 44(2): 201-236.
9. Bistarelli S, Montanari U, Rossi F, Santini F. Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming. Electronic Notes in Theoretical Computer Science Electron 2007; 190(3): 111-127.
10. Bueno F, Cabeza D, Carro M, Hermenegildo M, López-Garca P, Puebla G. The CIAO prolog system: reference manual. Technical Report CLIP3/97.1, School of Computer Science, Technical University of Madrid (UPM), 1997.
11. Gray E, Seigneur JM, Chen Y, Jensen CD. Trust propagation in small worlds. iTrust. Springer-Verlag, New York, NY, USA, 2003; 239-254.
12. Venkatraman M, Yu B, Singh MP. Trust and reputation management in a small-world network. In Proceedings of Fourth International Conference on MultiAgent Systems, 2000; 449-450.
13. Buchanan M. Nexus: Small Worlds and the Groundbreaking Theory of Networks. W.W. Norton & Co., Inc.: New York, NY, USA, 2003.
14. O'Madadhain J, Fisher D, White S, Boey Y. The JUNG (Java Universal Network/Graph) framework. Technical Report, UC Irvine, 2003.
15. Watts DJ, Strogatz SH. Collective dynamics of small-world networks. Nature 1998; 393: 440. DOI: 10.1038/30918
16. Horling B, Lesser V. A survey of multi-agent organizational paradigms. Knowledge Engineering Review 2004; 19(4): 281-316. DOI: http://dx.doi.org/10.1017/S0269888905000317
17. Bistarelli S, Santini F. Propagating multitrust within trust networks. SAC '08: Proceedings of the 2008 ACM Symposium on Applied Computing. ACM: New York, NY, USA, 2008; 1990-1994. DOI: http://doi.acm.org/10.1145/1363686.1364170
18. Bistarelli S, Santini F. SCLP for trust propagation in small-world networks, CSCLP, Lecture Notes in Computer Science, Vol. 5129, Fages F, Rossi F, Soliman S (eds). Springer: New York, NY, USA, 2007; 32-46.
19. Theodorakopoulos G, Baras JS. Trust evaluation in ad-hoc networks. WiSe '04: Proceedings of the 3rd ACM workshop on Wireless security. ACM: New York, NY, USA, 2004; 1-10. DOI: http://doi.acm.org/10.1145/1023646.1023648
20. Jøsang A, Ismail R, Boyd C. A survey of trust and reputation systems for online service provision. Decision Support Systems 2007; 43(2): 618-644. DOI: http://dx.doi.org/10.1016/j.dss.2005.05.019
21. Bistarelli S, Foley S, O'Sullivan B, Santini F. From marriages to coalitions: A soft CSP approach. Recent Advances in Constraints 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP, 2008, Revised Selected Papers, LNAI, Springer, 2008.
22. Twigg A, Dimmock N. Attack-resistance of computational trust models. WETICE '03, IEEE Computer Society, 2003; 275-280.
23. Granovetter MS. The strength of weak ties. The American Journal of Sociology 1973; 78(6): 1360-1380.
24. Čapkun S, Buttyán L, Hubaux JP. Small worlds in security systems: an analysis of the PGP certificate graph. NSPW '02: Proceedings of the 2002 workshop on New security paradigms. ACM: New York, NY, USA, 2002; 28-35 DOI: http://doi.acm.org/10.1145/844102.844108
25. Allenby R. Rings, Fields and Groups. Butterworth-Heinemann: 1992.
26. Bistarelli S, Gadducci F. Enhancing constraints manipulation in semiring-based formalisms. ECAI 2006, IOS Press, 2006; 63-67.
27. Georget Y, Codognet P. Compiling semiring-based constraints with clp (FD, S). CP '98: Proceeding of Principles and Practice of Constraint Programming. Springer-Verlag: London, UK, 1998; 205-219.
28. Bistarelli S, Montanari U, Rossi F. Constraint solving over semirings. Proceedings of IJCAI95 (Morgan Kaufman), Morgan Kaufman, 1995; 624-630.
29. Jaffar J, Maher M. Constraint logic programming: a survey. Journal of Logic Programming 1994; 19/20: 503-581.
30. Watts, D.J. Small worlds: the dynamics of networks between order and randomness. Smallworld. Princeton University Press. Princeton, NJ, USA 1999, ISBN No.:0-691-00541-9.
31. Abdul-Rahman A, Hailes S. A distributed trust model. NSPW '97: Proceedings of the 1997 Workshop on New Security Paradigms. ACM: New York, NY, USA, 1997; 48-60. DOI: http://doi.acm.org/10.1145/283699.283739
32. Bistarelli S, Martinelli F, Santini F. A Semantic Foundation for Trust Management Languages with Weights: An Application to the Rtfamily, ATC, Lecture Notes in Computer Science, Vol. 5060, Rong C, Jaatun MG, Sandnes FE, Yang LT, Ma J (eds). Springer: New York, NY, USA, 2008; 481-495.
33. Bistarelli S, Martinelli F, Santini F. Weighted datalog and levels of trust, ARES, IEEE Computer Society, 2008; 1128-1134.
34. Costa AC, Roe RA, Taillieu T. Trust within teams: the relation with performance effectiveness. European Journal of Work and Organizational Psychology 2001; 10(3): 225-244.
35. Griffiths N, Luck M. Coalition formation through motivation and trust. AAMAS '03: Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems. ACM: New York, NY, USA, 2003; 17-24. DOI: http://doi.acm.org/10.1145/860575.860579
36. Breban S, Vassileva J. A coalition formation mechanism based on inter-agent trust relationships. AAMAS '02: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems. ACM: New York, NY, USA, 2002; 306-307. DOI: http://doi.acm.org/10.1145/544741.544812
37. Lerman K, Shehory O. Coalition formation for large-scale electronic markets, ICMAS, IEEE Computer Society, 2000; 167-174.
38. Reiter MK, Stubblebine SG. Path independence for authentication in large-scale systems. CCS '97: Proceedings of the 4th ACM Conference on Computer and Communications Security, ACM: New York, NY, USA, 1997; 57-66. DOI: http://doi.acm.org/10.1145/266420.266435
39. Mingwu Z, Bo Y, Wenzheng Z. A semiring privacy protect model. NPC '07: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops. IEEE Computer Society: Washington, DC, USA, 2007; 255-262.
40. Eisner J. Parameter estimation for probabilistic finite-state transducers. ACL '02, Association for Computational Linguistics, 2001; 1-8. DOI: http://dx.doi.org/10.3115/1073083.1073085
41. Watts DJ. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press: Princeton, NJ, USA, 1999.
42. Ramakrishnan IV, Rao P, Sagonas KF, Swift T, Warren DS. Efficient tabling mechanisms for logic programs. International Conference on Logic Programming, The MIT Press, 1995; 697-711.
43. Wunderwald JE. Memoing evaluation by source-to-source transformation. LOPSTR '95: Proceedings of the 5th International Workshop on Logic Programming Synthesis and Transformation. Springer-Verlag: London, UK, 1996; 17-32.
44. Schrijvers T, Warren DS. Constraint Handling Rules and Tabled Execution, ICLP, LNCS, Vol. 3132, Springer: New York, NY, USA, 2004; 120-136.
45. Bistarelli S, Frühwirth T, Marte M. Soft constraint propagation and solving in chrs. SAC '02: Proceedings of the 2002 ACM Symposium on Applied Computing. ACM Press: New York, NY, USA, 2002; 1-5 DOI: http://doi.acm.org/10.1145/508791.508793
46. Iwama K, Miyazaki S. A survey of the stable marriage problem and its variants. International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008), IEEE Computer Society, 2008; 131-136.
47. Apt KR, Wallace M. Constraint Logic Programming using Eclipse. Cambridge University Press: New York, NY, USA, 2007.
48. Jøsang A, Hayward R, Pope S. Trust Network Analysis with Subjective Logic, ACSC, CRPIT, Vol. 48, Estivill-Castro V, Dobbie G (eds). Australian Computer Society: Sydney, Australia, 2006; 85-94.