Optimum threshold of group formation in multiagents
This paper presents a simple multi-agent model of group formation, while the behaviour is complicated. The statistical characteristics of the formation are suddenly changed at some states. Their agents are carrying characteristic vectors, meet each other in nondimensional free spaces without any res...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2019-01-01
|
Series: | MATEC Web of Conferences |
Online Access: | https://www.matec-conferences.org/articles/matecconf/pdf/2019/26/matecconf_jcmme2018_03010.pdf |
id |
doaj-d7fe7931adab4bc5bb212a19f374f75f |
---|---|
record_format |
Article |
spelling |
doaj-d7fe7931adab4bc5bb212a19f374f75f2021-03-02T10:03:58ZengEDP SciencesMATEC Web of Conferences2261-236X2019-01-012770301010.1051/matecconf/201927703010matecconf_jcmme2018_03010Optimum threshold of group formation in multiagentsShinkawa KodaiShioya IsamuThis paper presents a simple multi-agent model of group formation, while the behaviour is complicated. The statistical characteristics of the formation are suddenly changed at some states. Their agents are carrying characteristic vectors, meet each other in nondimensional free spaces without any restrictions randomly, and the agents make groups in the spaces if their characteristics are similar, that is, they have high similarities. Actually, for a given threshold on similarities, when the characteristic vectors between two agents are similar in the threshold, the agents join into one. They are not only for agents but also for groups, i.e. two groups can become into one if they are similar, and we repeat it. On the other hand, making groups decrease a satisfaction on groups. In this paper, we show, for a given threshold, there is not only an optimal threshold to maximize the satisfactions among groups which satisfy the threshold, but also the other one to minimize the satisfactions. The thresholds to maximize satisfactions are experimentally approximated by some function on the size of characteristic vectors rather than the number of agents.https://www.matec-conferences.org/articles/matecconf/pdf/2019/26/matecconf_jcmme2018_03010.pdf |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Shinkawa Kodai Shioya Isamu |
spellingShingle |
Shinkawa Kodai Shioya Isamu Optimum threshold of group formation in multiagents MATEC Web of Conferences |
author_facet |
Shinkawa Kodai Shioya Isamu |
author_sort |
Shinkawa Kodai |
title |
Optimum threshold of group formation in multiagents |
title_short |
Optimum threshold of group formation in multiagents |
title_full |
Optimum threshold of group formation in multiagents |
title_fullStr |
Optimum threshold of group formation in multiagents |
title_full_unstemmed |
Optimum threshold of group formation in multiagents |
title_sort |
optimum threshold of group formation in multiagents |
publisher |
EDP Sciences |
series |
MATEC Web of Conferences |
issn |
2261-236X |
publishDate |
2019-01-01 |
description |
This paper presents a simple multi-agent model of group formation, while the behaviour is complicated. The statistical characteristics of the formation are suddenly changed at some states. Their agents are carrying characteristic vectors, meet each other in nondimensional free spaces without any restrictions randomly, and the agents make groups in the spaces if their characteristics are similar, that is, they have high similarities. Actually, for a given threshold on similarities, when the characteristic vectors between two agents are similar in the threshold, the agents join into one. They are not only for agents but also for groups, i.e. two groups can become into one if they are similar, and we repeat it. On the other hand, making groups decrease a satisfaction on groups. In this paper, we show, for a given threshold, there is not only an optimal threshold to maximize the satisfactions among groups which satisfy the threshold, but also the other one to minimize the satisfactions. The thresholds to maximize satisfactions are experimentally approximated by some function on the size of characteristic vectors rather than the number of agents. |
url |
https://www.matec-conferences.org/articles/matecconf/pdf/2019/26/matecconf_jcmme2018_03010.pdf |
work_keys_str_mv |
AT shinkawakodai optimumthresholdofgroupformationinmultiagents AT shioyaisamu optimumthresholdofgroupformationinmultiagents |
_version_ |
1724237917830774784 |