File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Tragedy of the commons in online social search

TitleTragedy of the commons in online social search
Authors
KeywordsAnalytical model
Extensive simulations
Incentive mechanism
Incentive schemes
Optimal state
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
The 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of ICC 2011, 2011, p. 1-5 How to Cite?
AbstractOnline social search (OSS) brings forth a new way to harness the Internet for answers. In this paper, we study the non-cooperation problem in OSS. We propose an analytical model that captures the behavior of OSS nodes, and, from a gaming-strategy point of view, analyze various strategies an individual node can utilize to allocate its awareness capacity. Based on this we derive the Pareto inefficiency in terms of the system cost. We also propose an incentive scheme under which the optimal state of individual nodes is also optimal for the whole system. Extensive simulations show that the strategy under our proposed incentive mechanism outperforms other strategies in terms of the system cost and the search success rate. To the best of our knowledge, this is the first study of the tragedy-of-the-commons problem in OSS. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/142814
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorYang, Yen_HK
dc.contributor.authorXu, Ken_HK
dc.contributor.authorLi, VOKen_HK
dc.date.accessioned2011-10-28T02:56:05Z-
dc.date.available2011-10-28T02:56:05Z-
dc.date.issued2011en_HK
dc.identifier.citationThe 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of ICC 2011, 2011, p. 1-5en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/142814-
dc.description.abstractOnline social search (OSS) brings forth a new way to harness the Internet for answers. In this paper, we study the non-cooperation problem in OSS. We propose an analytical model that captures the behavior of OSS nodes, and, from a gaming-strategy point of view, analyze various strategies an individual node can utilize to allocate its awareness capacity. Based on this we derive the Pareto inefficiency in terms of the system cost. We also propose an incentive scheme under which the optimal state of individual nodes is also optimal for the whole system. Extensive simulations show that the strategy under our proposed incentive mechanism outperforms other strategies in terms of the system cost and the search success rate. To the best of our knowledge, this is the first study of the tragedy-of-the-commons problem in OSS. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104-
dc.relation.ispartofProceedings of the IEEE International Conference on Communications, ICC 2011en_HK
dc.rightsIEEE International Conference on Communications. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectAnalytical model-
dc.subjectExtensive simulations-
dc.subjectIncentive mechanism-
dc.subjectIncentive schemes-
dc.subjectOptimal state-
dc.titleTragedy of the commons in online social searchen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1550-3607&volume=&spage=&epage=&date=2011&atitle=Tragedy+of+the+Commons+in+online+social+search-
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/icc.2011.5963477en_HK
dc.identifier.scopuseid_2-s2.0-80052144150en_HK
dc.identifier.hkuros196897en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052144150&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage5-
dc.description.otherThe 2011 IEEE International Conference on Communications (ICC 2011), Kyoto, Japan, 5-9 June 2011. In Proceedings of ICC 2011, 2011, p. 1-5-
dc.identifier.scopusauthoridYang, Y=50263693100en_HK
dc.identifier.scopusauthoridXu, K=35101233700en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats