A. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J. Martin et al., BAR fault tolerance for cooperative services, SOSP, 2005.

S. and B. Mokhtar, RAC: a freerider-resilient, scalable, anonymous communication protocol, ICDCS, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00945795

S. and B. Mokhtar, FireSpam: Spam resilient gossiping in the BAR model, Proc. of SRDS, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00945724

M. Biely, Distal: A framework for implementing fault-tolerant distributed algorithms, 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2013.
DOI : 10.1109/DSN.2013.6575306

L. Buttyán and J. Hubaux, Rational Exchange - A Formal Model Based on Game Theory, Electronic Commerce, 2001.
DOI : 10.1007/3-540-45598-1_12

L. Buttyán and J. Hubaux, Stimulating cooperation in self-organizing mobile ad hoc networks, Mobile Networks and Applications, 2003.

Z. Shen, Peer-to-peer media streaming: Insights and new developments, Proc. of the IEEE, 2011.

T. Ban, S. Guo, Z. Zhang, R. Ando, and Y. Kadobayashi, Practical network traffic analysis in P2P environment, 2011 7th International Wireless Communications and Mobile Computing Conference, 2011.
DOI : 10.1109/IWCMC.2011.5982808

C. Systems, Cisco Visual Networking Index: Forecast and Methodology, 2015.

M. Cagalj, S. Ganeriwal, I. Aad, and J. Hubaux, On selfish behavior in CSMA/CA networks, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005.
DOI : 10.1109/INFCOM.2005.1498536

I. Cunha, Can peer-to-peer live streaming systems coexist with free riders, P2P, 2013.

J. Decouchant, S. B. Mokhtar, and V. Quéma, AcTinG: Accurate Freerider Tracking in Gossip, SRDS, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01198451

A. Diarra, S. B. Mokhtar, P. Aublin, and V. Quéma, FullReview: Practical Accountability in Presence of Selfish Nodes, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, 2014.
DOI : 10.1109/SRDS.2014.32
URL : https://hal.archives-ouvertes.fr/hal-01301079

M. Feldman, Free-riding and whitewashing in peer-to-peer systems, IEEE J. Sel. Areas Commun, vol.24, issue.5, 2006.

J. Freudiger, On non-cooperative location privacy: a gametheoretic analysis, CCS, 2009.

D. Goldschlag, M. Reed, and P. Syverson, Onion routing, Communications of the ACM, vol.42, issue.2, pp.39-41, 1999.
DOI : 10.1145/293411.293443

R. Guerraoui, LiFTinG: Lightweight Freerider-Tracking in Gossip, Middleware, 2010.
DOI : 10.1007/978-3-642-16955-7_16
URL : https://hal.archives-ouvertes.fr/inria-00505268

A. Haeberlen, P. Aditya, R. Rodrigues, and P. Druschel, Accountable virtual machines, OSDI, 2010.

A. Haeberlen, P. Kouznetsov, and P. Druschel, PeerReview: Practical accountability for distributed systems, SOSP, 2007.

D. Hughes, G. Coulson, and J. Walkerdine, Free riding on Gnutella revisited: the bell tolls? " Distributed Systems Online, IEEE, issue.6, p.6, 2005.

C. Killian, J. Anderson, R. Braud, R. Jhala, and A. Vahdat, Mace: Language support for building distributed systems, PLDI, 2007.

D. Koller, N. Megiddo, B. Von-stengel, and G. L. Cota, Fast algorithms for finding randomized strategies in game trees Racoon: Technical report Available: https, STOC, 1994.

H. C. Li, FlightPath: Obedience vs. choice in cooperative services, OSDI, 2008.

H. C. Li, A. Clement, E. Wong, J. Napper, I. Roy et al., BAR gossip, OSDI, 2006.

S. Marti and H. Garcia-molina, Taxonomy of trust: Categorizing P2P reputation systems, Computer Networks, vol.50, issue.4, 2006.
DOI : 10.1016/j.comnet.2005.07.011

M. J. Osborne, A course in game theory, 1994.

V. Srivastava, Using game theory to analyze wireless ad hoc networks, IEEE Communications Surveys & Tutorials, vol.7, issue.4, 2005.
DOI : 10.1109/COMST.2005.1593279

P. Urbán, X. Défago, and A. Schiper, Neko: a single environment to simulate and prototype distributed algorithms, Proceedings 15th International Conference on Information Networking, 2001.
DOI : 10.1109/ICOIN.2001.905471

S. Zhong, Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks ACKNOWLEDGMENT The presented work was developed within the EEXCESS project funded by the EU FP7 (Grant n. 600601) This work was also partly supported by the program CMIRA2014 Coopera, INFOCOM of the Region Rhone-Alpes, France, and by the project Vinci of the Univ. Franco-Italienne, 2003.