We consider the problem of partitioning n agents in an undirected social network into k almost equal size (differing by at most one) groups, where utility agent for a group is number her neighbors group. The core and envy-freeness are two compelling axiomatic fairness guarantees such settings. former demands that there be no coalition each has more than own group, while latter envy another they...

Objective: This research aimed at evaluating the moderator role of school connection on the impact of violent friends towards aggressive behaviors in adolescent students of Tehran high schools. Methods: A sample of 3529 participants from Tehran high school students was selected using multistage sampling method. Participants completed school connection questionnaire (SCQ), Iranian adolescents...

We describe a simple and fast algorithm for identifying friends-of-friends clusters and prove its correctness. The algorithm avoids unnecessary expensive neighbor queries, uses minimal memory overhead, and rejects slowdown in high over-density regions. We define our algorithm formally based on pair enumeration, a problem that has been heavily studied in fast 2-point correlation codes and our re...

OBJECTIVE To investigate the influences of resources and food-related goals on the variety of food choice among older people. DESIGN A questionnaire-based survey in eight European countries: Poland, Portugal, United Kingdom, Germany, Sweden, Denmark, Italy and Spain. SUBJECTS Participants (n 3200) were above 65 years of age and living in their own homes. The samples were quota samples, eigh...

Supply chain phenomena such as the bullwhip e.ect and boom and bust have been widely studied. However, their interaction with other factors has not been elaborated. We use scenario-based dynamic simulations to study the short product life cycle case, exempli2ed by TamagotchiTM, which was the 2rst of the virtual pet toys. Our model has three components, market, retail and factory. To simulate th...