NSF NeTS: Collaborative Research: Supporting unstructured peer-to-peer social networking

G. Kesidis (PSU PI) and G. de Veciana (U.T. Austin PI)




In the context of peer-to-peer (p2p) social networking, we particularly focused on two areas of study: (a) selfishness and altruism for various frameworks of social engagement (some taken from simple, classical networking objectives in order to prove theoretical results), and (b) threats of misinformation, targeting a social (interaction based) reputation systems or a consensus/polling process, and ways to mitigate them. We aimed to achieve cooperation online that is both robust to selfish/dishonest behaviour and to incentivize honest cooperation (e.g., through reciprocity).



         Papers and personnel participating in work supported in whole or part by this grant:


·      A. Kurve, D.J. Miller, and G. Kesidis. (2013). Proc. GameSec (Security Games). Defeating Tyranny of the Masses: Semisupervised Multicategory Crowdsourcing Accounting for Worker Skill and Intention, Task Difficulty, and Task Heterogeneity. Dallas.

·      A. Kurve, C. Griffin, D.J. Miller and G. Kesidis. (2013). Optimizing Cluster Formation in Super-Peer Networks via Local Incentive Design.  Journal of Peer-to-Peer Networking and Applications, Springer.

·      A. Kurve, K. Kotobi and G. Kesidis. (2013). An agent-based framework for performance modeling of an optimistic parallel discrete event simulator.  Complex Adaptive Systems Modeling.

·      P. Antoniadis, S. Fdida, C. Griffin, G. Kesidis, Y. Jin. (2013). CSMA Local Area Networking under Dynamic Altruism.  EURASIP J. on Wireless Comm. and Net, (Aug).

·      Y. Jin, Y. Yi, G. Kesidis and J. Shin. (2013). Proc. IEEE INFOCOM. Hybrid Client-Server and Peer-to-Peer Caching Systems with Selfish Peers. Turin, Italy.

·      A. Kurve, G. Pang, G. Kesidis, and G. de Veciana. (2012). Proc. CISS. Decentralized capacity reallocation for a loss network. Princeton University.

·      V. Shah, G. de Veciana, and G. Kesidis. (2012). Proc. IEEE INFOCOM. Learning to route queries in unstructured P2P systems: Achieving throughput optimality subject to query resolution constraints. Orlando, FL.

·      G. Kesidis and A. Kurve. (2012). Proc. IEEE ICC. An agent-based framework for performance modeling of an optimistic parallel discrete event simulator. Ottawa.

·      G. Kesidis and Y. Jin. (2012). Proc. Int'l Conf. on Game Theory for Networks (GameNets). Stochastic Loss Aversion for Random Medium Access. Vancouver.

·      G. Kesidis and A. Kurve. (2012). Proc. IEEE ICC. A study of unsupervised adaptive crowdsourcing. Ottawa.

·      A. Kurve and G. Kesidis. (2011). Proc. IEEE ICC. Sybil Detection via Distributed Sparse Cut Monitoring. Kyoto.

·      G. Kesidis. (2010). An Introduction to Models of Online Peer-to-Peer Social Networking. Morgan & Claypool Publ., San Francisco.

·      G. Kesidis, Y. Jin, A. Amar and E. Altman. (2010). Proc. IEEE CDC. Stable Nash equilibria of medium access games under symmetric, socially altruistic behavior. Atlanta, GA.

·      G. Kesidis, A. Tangpong and C. Griffin. (2009). A sybil-proof referral system based on multiplicative reputation chains..  IEEE Comm. Letters, (Nov.).