A group strategy‐proof incentive approach for eliminating selfish behaviors in peer‐to‐peer file allocation
暂无分享,去创建一个
[1] Jian Yu,et al. Trust‐aware query routing in P2P social networks , 2012, Int. J. Commun. Syst..
[2] Kevin Leyton-Brown,et al. Incentives for sharing in peer-to-peer networks , 2001, EC '01.
[3] Karl Aberer,et al. P-Grid: a self-organizing structured P2P system , 2003, SGMD.
[4] Peter Widmayer,et al. Balanced Distributed Search Trees Do Not Exist , 1995, WADS.
[5] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[6] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[7] Jia Wang,et al. Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..
[8] Joan Feigenbaum,et al. A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.
[9] Wei-Guang Teng,et al. Exploiting scheduling and free-riding for offline downloading in BitTorrent networks , 2013, Int. J. Commun. Syst..
[10] Chow-Sing Lin. Enhancing P2P live streaming performance by balancing description distribution and available forwarding bandwidth in P2P streaming network , 2011, Int. J. Commun. Syst..
[11] Joseph Y. Halpern,et al. Efficiency and nash equilibria in a scrip system for P2P networks , 2006, EC '06.
[12] Jerry R. Green,et al. Characterization of Satisfactory Mechanisms for the Revelation of Preferences for Public Goods , 1977 .
[13] John N. Tsitsiklis,et al. Efficiency loss in a network resource allocation game: the case of elastic supply , 2005, IEEE Trans. Autom. Control..
[14] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[15] David K. Y. Yau,et al. Incentive and Service Differentiation in P2P Networks: A Game Theoretic Approach , 2006, IEEE/ACM Transactions on Networking.
[16] Zhen Yang,et al. Hotspot Avoidance for P2P Streaming Distribution Application: A Game Theoretic Approach , 2009, IEEE Transactions on Parallel and Distributed Systems.
[17] Li Ming,et al. An Algorithm of B\++ Tree Management in P2P Environment , 2005 .
[18] Karl Aberer,et al. Updates in highly unreliable, replicated peer-to-peer systems , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..
[19] Joseph Naor,et al. Non-Cooperative Multicast and Facility Location Games , 2007, IEEE J. Sel. Areas Commun..
[20] Emin Gün Sirer,et al. KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing , 2003 .
[21] Baochun Li,et al. Strategyproof mechanisms for dynamic tree formation in overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[22] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[23] Eytan Adar,et al. Free Riding on Gnutella , 2000, First Monday.
[24] Joan Feigenbaum,et al. Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.
[25] Mary Baker,et al. CUP: Controlled Update Propagation in Peer-to-Peer Networks , 2003, USENIX Annual Technical Conference, General Track.
[26] Yiming Hu,et al. Efficient, proximity-aware load balancing for DHT-based P2P systems , 2005, IEEE Transactions on Parallel and Distributed Systems.
[27] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.