Overcoming free-riding behavior in peer-to-peer systems
暂无分享,去创建一个
[1] Levente Buttyán,et al. Enforcing service availability in mobile ad-hoc WANs , 2000, MobiHoc.
[2] Chrysanthos Dellarocas,et al. Online Reputation Mechanisms a Roadmap for Future Research Summary Report of the First Interdisciplinary Symposium on Online Reputation Mechanisms , 2022 .
[3] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[4] Alice Cheng,et al. Sybilproof reputation mechanisms , 2005, P2PECON '05.
[5] Srinivasan Seshan,et al. Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP , 2002, SIGCOMM '02.
[6] Geoff Coulson,et al. Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.
[7] William Vickrey,et al. Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .
[8] Hector Garcia-Molina,et al. The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.
[9] Markus Jakobsson,et al. A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks , 2003, Financial Cryptography.
[10] Hui Zhang,et al. A case for taxation in peer-to-peer streaming broadcast , 2004, PINS '04.
[11] J. Verbraecken,et al. Contents , 2021, Sleep Medicine Clinics.
[12] Nazareno Andrade,et al. Influences on cooperation in BitTorrent communities , 2005, P2PECON '05.
[13] Scott Shenker,et al. Hidden-action in multi-hop routing , 2005, EC '05.
[14] Michal Feldman,et al. Incentives for Cooperation in Peer-to-Peer Systems , 2005 .
[15] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[16] B. Cohen,et al. Incentives Build Robustness in Bit-Torrent , 2003 .
[17] Munindar P. Singh,et al. A Social Mechanism of Reputation Management in Electronic Communities , 2000, CIA.
[18] Boi Faltings,et al. Reputation-based pricing of P2P services , 2005, P2PECON '05.
[19] Ion Stoica,et al. Robust incentive techniques for peer-to-peer networks , 2004, EC '04.
[20] Christos H. Papadimitriou,et al. Selfish caching in distributed systems: a game-theoretic analysis , 2004, PODC '04.
[21] J. Andreoni. Giving with Impure Altruism: Applications to Charity and Ricardian Equivalence , 1989, Journal of Political Economy.
[22] Chrysanthos Dellarocas,et al. Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior , 2000, EC '00.
[23] Michal Feldman,et al. The evolution of cooperation under cheap pseudonyms , 2005, Seventh IEEE International Conference on E-Commerce Technology (CEC'05).
[24] J. Shneidman,et al. Overcoming Rational Manipulation in Mechanism Implementations , 2003 .
[25] Joan Feigenbaum,et al. Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.
[26] Joan Feigenbaum,et al. Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..
[27] Mustaque Ahamad,et al. Incentives in BitTorrent induce free riding , 2005, P2PECON '05.
[28] E. H. Clarke. Multipart pricing of public goods , 1971 .
[29] Mostafa H. Ammar,et al. A reputation system for peer-to-peer networks , 2003, NOSSDAV '03.
[30] Peter Druschel,et al. Incentives-Compatible Peer-to-Peer Multicast , 2004 .
[31] Tim Roughgarden,et al. Pricing Networks with Selfish Routing , 2003 .
[32] E. Friedman,et al. The Social Cost of Cheap Pseudonyms , 2001 .
[33] Theodore Groves,et al. Incentives in Teams , 1973 .
[34] Nicolas Christin,et al. A cost-based analysis of overlay routing geometries , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[35] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[36] Miguel Castro,et al. SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.
[37] Eytan Adar,et al. Free Riding on Gnutella , 2000, First Monday.
[38] Kevin Leyton-Brown,et al. Incentives for sharing in peer-to-peer networks , 2001, EC '01.
[39] Hal R. Varian,et al. Economic Mechanism Design for Computerized Agents , 1995, USENIX Workshop on Electronic Commerce.
[40] Nicolas Christin,et al. Near rationality and competitive equilibria in networked systems , 2004, PINS '04.
[41] Jeffrey S. Rosenschein and Gilad Zlotkin. Rules of Encounter , 1994 .
[42] Eric J. Friedman,et al. Learning and Implementation on the Internet , 1997 .
[43] Joan Feigenbaum,et al. A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.
[44] P. Resnick,et al. Online Reputation Mechanisms-A Roadmap for Future Research , 2003 .
[45] Sheng Zhong,et al. Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[46] Marvin A. Sirbu,et al. Inefficiency in provisioning interconnected communication networks , 2005, EC '05.
[47] Jonathan Katz,et al. A Game-Theoretic Framework for Analyzing Trust-Inference Protocols , 2004 .
[48] S. Buchegger,et al. A Robust Reputation System for Peer-to-Peer and Mobile Ad-hoc Networks , 2004 .
[49] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .
[50] Christos H. Papadimitriou,et al. Free-riding and whitewashing in peer-to-peer systems , 2004, IEEE Journal on Selected Areas in Communications.
[51] Miguel Castro,et al. Security for Structured Peer-to-peer Overlay Networks , 2004 .