Incentive-compatible diffusion

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Our work bridges the literature on incentive-compatible mechanism design and the literature on diffusion algorithms. We introduce the study of finding an incentive-compatible (strategy-proof) mechanism for selecting an influential vertex in a directed graph (e.g. Twitter»s network). The goal is to devise a mechanism with a bounded ratio between the maximal influence and the influence of the selected user, and in which no user can improve its probability of being selected by following or unfollowing other users. We introduce the Two Path mechanism which is based on the idea of selecting the vertex that is the first intersection of two independent random walks in the network. The Two Path mechanism is incentive compatible on directed acyclic graphs (DAGs), and has a finite approximation ratio on natural subfamilies of DAGs. Simulations indicate that this mechanism is suitable for practical uses.

Original languageEnglish
Title of host publicationThe Web Conference 2018 - Proceedings of the World Wide Web Conference, WWW 2018
Number of pages10
ISBN (Electronic)9781450356398
StatePublished - 10 Apr 2018
Event27th International World Wide Web, WWW 2018 - Lyon, France
Duration: 23 Apr 201827 Apr 2018

Publication series

NameThe Web Conference 2018 - Proceedings of the World Wide Web Conference, WWW 2018


Conference27th International World Wide Web, WWW 2018


  • Diffusion
  • Strategy-proof

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software


Dive into the research topics of 'Incentive-compatible diffusion'. Together they form a unique fingerprint.

Cite this