@article{yu_singh_2004, title={Incentive mechanisms for peer-to-peer systems}, volume={2872}, ISBN={3540405380}, url={https://publons.com/publon/21294483/}, DOI={10.1007/978-3-540-25840-7_9}, abstractNote={Most of the existing research in peer-to-peer systems focuses on protocol design and doesn’t consider the rationality of each peer. One phenomenon that should not be ignored is free riding. Some peers simply consume system resources but contribute nothing to the system. In this paper we present an agent-based peer-to-peer system, in which each peer is a software agent and the agents cooperate to search the whole system through referrals. We present a static and a dynamic pricing mechanism to motivate each agent to behave rationally while still achieving good overall system performance. We study the behavior of the agents under two pricing mechanisms and evaluate the impact of free riding using simulations.}, journal={Lecture Notes in Computer Science}, publisher={Berlin; New York: Springer}, author={Yu, B. and Singh, Munindar P.}, editor={G. Moro and Koubarakis, M.Editors}, year={2004}, pages={77–88} } @article{yu_venkatraman_singh_2003, title={An adaptive social network for information access: Theoretical and experimental results}, volume={17}, url={https://publons.com/publon/21294487/}, DOI={10.1080/08839510390169738}, number={1}, journal={Applied Artificial Intelligence}, author={Yu, B. and Venkatraman, M. and Singh, Munindar P.}, year={2003}, pages={21–38} } @article{yu_singh_2002, title={Distributed reputation management for electronic commerce}, volume={18}, ISSN={["1467-8640"]}, url={https://publons.com/publon/21294511/}, DOI={10.1111/1467-8640.00202}, abstractNote={One of the major challenges for electronic commerce is how to establish a relationship of trust between different parties. Establishing trust is nontrivial, because the traditional physical or social means of trust cannot apply directly in virtual settings. In many cases, the parties involved may not ever have interacted before. Reputation systems seek to address the development of trust by recording the reputations of different parties. However, most existing reputation systems are restricted to individual market websites. Further, relevant information about a party may come from several websites and from interactions that were not mediated by any website.}, number={4}, journal={COMPUTATIONAL INTELLIGENCE}, author={Yu, B and Singh, MP}, year={2002}, month={Nov}, pages={535–549} } @article{singh_yu_venkatraman_2001, title={Community-based service location - How virtual communities and software agents can be used to provide and locate trustworthy services on the internet.}, volume={44}, ISSN={["1557-7317"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-0001812831&partnerID=MN8TOARS}, DOI={10.1145/367211.367255}, abstractNote={lthough both computing and communications capabilities are improving exponentially, there has been a more rapid increase in available bandwidth than in computing power over recent years [6]. Naturally enough, while the network-related improvements create new possibilities for applications, the improvements and especially their differential, render obsolete traditional ways of thinking about telecommunications and computing. There is an ongoing debate occurring among two main factions within the telecommunications industry [1, 4]. On one side are traditional telephone companies, who advocate intelligent networks with increased intelligence embedded within the network and controlled by the telecommunications providers. The intelligence would be reflected in features such as for caller identification or call forwarding. On the other side are the proponents of (what may be called) stupid networks, who take their inspiration from the Internet. In this view, as bandwidth becomes plentiful, intelligence will propagate to the edges of the network and the network itself will provide no more than bit transport. The overwhelming advantage of stupid networks is that, like the Internet, they naturally support heterogeneity and extensibility. End users can choose whichever applications they like and invoke whichever services they prefer without requiring consistent changes throughout a large network. Consider telephone directories. White pages and yellow pages are essential for making a telecommunications system practical, but are classical centralized functionalities. Internet portals are a close analogue of telephone directories, and provide a one-size-fits-all solution to users’ information needs. However, just as advances in computing are driving manufacturing from mass production to mass customization, advances in communication are driving information access from large portals toward personal contacts. Large portals won’t be eliminated, but will increasingly be supplemented and superseded by personalized sources of information as people increasingly want to receive information and advice from those whom they know and trust. Accordingly, in this article we consider the problem of service location. We study an approach that places the intelligence on the endpoints, enabling the users to locate desirable services based on trustworthy, personalized recommendations of their peers. The task is not only to locate a particular service, but also to locate a service that is rated highly by one’s friends and associ-}, number={4}, journal={COMMUNICATIONS OF THE ACM}, author={Singh, MP and Yu, B and Venkatraman, M}, year={2001}, month={Apr}, pages={49–54} } @inproceedings{yu_singh_2000, title={A social mechanism of reputation management in electronic communities}, volume={1860}, booktitle={Cooperative information agents IV: The future of information agents in cyberspace: 4th International Workshop, CIA 2000, Boston, MA, USA, July 7-9, 2000: Proceedings}, publisher={Berlin: Springer}, author={Yu, B. and Singh, M. P.}, editor={M. Klusch and Kerschberg, L.Editors}, year={2000}, pages={154–165} }