Online services such as e-marketplaces, social networking sites, online gaming environments etc have grown in popularity in the recent years. These services represent situation where participants do not get to negotiate face to face before interaction and most of the time parties to transaction remain anonymous. It is thus necessary to have a system that rightly assesses trustworthiness of the other party in order to maintain quality assurance in such systems. Recent works on Trust and Reputation in online communities have focused on identifying probable defaulters, but less effort has been put to come up with system that make cooperation attractive over defection in order to achieve cooperation without enforcement. Our work in this regard concerns design and investigation of trust assessment systems that not only filter defaulters but also promote evolution of cooperativeness in player society. Based on the concept of game theory and prisoner's dilemma, we model business games and design incentive method, compensation method, acquaintance based assessment method and decision theoretic assessment method as mechanisms to assure trustworthiness in online business environments. Effectiveness of each of these methods in promoting the evolution of cooperation in player society has been investigated. Our results show that these methods contribute positively in promoting cooperative evolution. We have further extended our trust assessment model to suit the needs of a mobile ad-hoc network setting. The effectiveness of this model has been tested against its capability to reduce packet drop rate and energy conservation. In both of these the results show promise.
Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:533399 |
Date | January 2010 |
Creators | Bista, Sanat K. |
Contributors | Dahal, Keshav P. ; Cowling, Peter I. |
Publisher | University of Bradford |
Source Sets | Ethos UK |
Detected Language | English |
Type | Electronic Thesis or Dissertation |
Source | http://hdl.handle.net/10454/4424 |
Page generated in 0.0016 seconds