中文
相关论文

相关论文: Existence of Comfortable Team in some Special Soci…

200 篇论文

There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. We have defined a new SNA index called "comfortability". In this paper, core comfortable team of a social network is defined based…

社会与信息网络 · 计算机科学 2014-06-05 Lakshmi Prabha S , T. N. Janakiraman

There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. In this paper, we define a new SNA index called "comfortability". One among the lack of many factors, which affect the effectiveness…

数据结构与算法 · 计算机科学 2014-05-20 Lakshmi Prabha S , T. N. Janakiraman

The paper discusses diverse interconnected relationships formed within a seemingly unrelated group of students and a conceptually different problem statement. This study uses a Social Network Analysis (SNA) to analyze and map the…

社会与信息网络 · 计算机科学 2022-01-03 Deekshajyothi S , Gowrishankar G

In this paper, we investigate the profit-driven team grouping problem in social networks. We consider a setting in which people possess different skills, and the compatibility between these individuals is captured by a social network.…

社会与信息网络 · 计算机科学 2022-11-02 Shaojie Tang , Jing Yuan , Tao Li , Yao Wang

The problem of team formation in a social network asks for a set of individuals who not only have the required skills to perform a task but who can also communicate effectively with each other. Existing work assumes that all links in a…

数据结构与算法 · 计算机科学 2020-10-29 Ioannis Kouvatis , Konstantinos Semertzidis , Maria Zerva , Evaggelia Pitoura , Panayiotis Tsaparas

In this paper, we study the problem of Team Member Replacement: given a team of people embedded in a social network working on the same task, find a good candidate who can fit in the team after one team member becomes unavailable. We…

社会与信息网络 · 计算机科学 2014-09-22 Liangyue Li , Hanghang Tong , Nan Cao , Kate Ehrlich , Yu-Ru Lin , Norbou Buchler

In a team formation problem, one is required to find a group of users that can match the requirements of a collaborative task. Example of such collaborative tasks abound, ranging from software product development to various participatory…

社会与信息网络 · 计算机科学 2015-03-20 Samik Datta , Anirban Majumder , KVM Naidu

We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups. We show that if multiple groups can simultaneously engage…

计算机科学与博弈论 · 计算机科学 2016-11-15 Ayumi Igarashi , Dominik Peters , Edith Elkind

In studies of social dynamics, cohesion refers to a group's tendency to stay in unity, which -- as argued in sociometry -- arises from the network topology of interpersonal ties between members of the group. We follow this idea and propose…

社会与信息网络 · 计算机科学 2016-12-28 Jiamou Liu , Ziheng Wei

We propose a family of models to study the evolution of ties in a network of interacting agents by reinforcement and penalization of their connections according to certain local laws of interaction. The family of stochastic dynamical…

物理与社会 · 物理学 2016-06-01 Augusto Almeida Santos , Soummya Kar , Ramayya Krishnan , José M. F. Moura

We study the consequences of adopting products by agents who form a social network. To this end we use the threshold model introduced in Apt and Markakis, arXiv:1105.2434, in which the nodes influenced by their neighbours can adopt one out…

社会与信息网络 · 计算机科学 2012-11-30 Sunil Simon , Krzysztof R. Apt

Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of…

离散数学 · 计算机科学 2024-09-02 Arnaud Casteigts , Timothée Corsini , Writika Sarkar

We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize the graphs for which adoption of a product by the whole network is possible…

社会与信息网络 · 计算机科学 2015-03-19 Krzysztof R. Apt , Evangelos Markakis

We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize social networks for which adoption of a product by the whole network is…

社会与信息网络 · 计算机科学 2015-03-20 Krzysztof R. Apt , Evangelos Markakis

A firm-worker hypergraph consists of edges in which each edge joins a firm and its possible employees. We show that a stable matching exists in both many-to-one matching with transferable utilities and discrete many-to-one matching when the…

理论经济学 · 经济学 2023-11-13 Chao Huang

One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXiv:1105.2434 introduced a threshold model, in which the nodes…

计算机科学与博弈论 · 计算机科学 2013-04-09 Sunil Simon , Krzysztof R. Apt

The purpose of this paper is to suggest additional aspects of social psychology that could help when making sense of autonomous agile teams. To make use of well-tested theories in social psychology and instead see how they replicated and…

软件工程 · 计算机科学 2020-11-09 Lucas Gren

Recently, Apt and Markakis introduced a model for product adoption in social networks with multiple products, where the agents, influenced by their neighbours, can adopt one out of several alternatives (products). To analyze these networks…

计算机科学与博弈论 · 计算机科学 2013-07-18 Krzysztof R. Apt , Sunil Simon

We propose featured team automata to support variability in the development and analysis of teams, which are systems of reactive components that communicate according to specified synchronisation types. A featured team automaton concisely…

形式语言与自动机理论 · 计算机科学 2021-08-05 Maurice H. ter Beek , Guillermina Cledou , Rolf Hennicker , José Proença

We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups (gGASP). We show that if multiple groups can simultaneously…

计算机科学与博弈论 · 计算机科学 2017-12-08 Ayumi Igarashi , Robert Bredereck , Dominik Peters , Edith Elkind
‹ 上一页 1 2 3 10 下一页 ›