Abstract

Computational models are one of the very powerful tools for expressing everyday situations that are derived from human interactions. In this paper, an investigation of the problem of forming beneficial groups based on the members' preferences and the coordinator's own strategy is presented . It is assumed that a coordinator has a good intention behind trimming members' preferences to meet the ultimate goal of forming the group. His strategy is justified and evaluated by Nash stability. There are two variations of the problem: the Anonymous Stable Beneficial Group Activity Formation and the General Stable Beneficial Group Activity Formation. The computational complexity of solving both variations has been analyzed. Finding stable groups needs non-polynomial time algorithm to be solved. A polynomial time solution is presented and enhanced with examples

Highlights

  • Capturing human behavior and translating it into a model has been the area of research since centuries

  • Many powerful systems were created as the result of merging social behavior and computational models, examples are: emails, social networks, online gaming, political parties formation, healthcare systems, speaker identification, query expansion techniques [1][7][17],etc

  • The main contribution of this work is the analysis of the stable beneficial group activity formation problem considering the members' preferences as well as the coordinator strategy

Read more

Summary

INTRODUCTION

Capturing human behavior and translating it into a model has been the area of research since centuries. In the scope of this paper, an investigation of the area of beneficial group activities formation that can be classified under coordinating collective actions is presented. Scheduling a set of activities has been studied thoughtfully in the literature; one of the new trends in this field is how to schedule activities that each of them should compromise a set of agents To formulate this problem, let's consider the social situation that an event coordinator is trying to organize multiple distributed activities that are held in different places at different time intervals.

RELATED LITRETURE
STABLE BENEFICIAL GROUP ACTIVITY FORMATION PROBLEM
Definitions and Notations
Examples of ABGA
ABGA Algorithm and Complexity Analysis
GENERAL BENEFICIAL GROUP ACTIVITY FORMATION PROBLEM GBGA
Definitions and Notations An instance of the General Group Activity Formation
GBGA Example
GBGA Algorithm and Complexity Analysis
CONCLUSION AND DISCUSSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call