On package organization for willingness satisfaction in social networks

Studies show that both the personal preference and social tightness between friends play important roles in the decision process of activity participation for a person. Considering the preference of a person and the social tightness among friends, in this work, we formulate a new research problem, called Package Organization for Willingness sAtisfaction (POWA), to effectively select items into a package that can be adopted by the most users. Efficiently obtaining the optimal package and the corresponding group of users under the setting of POWA is very challenging, as we prove that POWA is NP-hard. Aiming to strike a balance between the quality of solutions and the time needed for computation, we propose algorithm Intermediate Package Organization with Social and Preference Pruning (IPOSPP) to obtain good solutions efficiently. We conduct an extensive performance evaluation on four real datasets to demonstrate the performance of the proposed algorithm.