<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Artif. Intell.</journal-id>
<journal-title>Frontiers in Artificial Intelligence</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Artif. Intell.</abbrev-journal-title>
<issn pub-type="epub">2624-8212</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frai.2023.1235231</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Artificial Intelligence</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Metropolis-Hastings algorithm in joint-attention naming game: experimental semiotics study</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" equal-contrib="yes">
<name><surname>Okumura</surname> <given-names>Ryota</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/2409972/overview"/>
</contrib>
<contrib contrib-type="author" corresp="yes" equal-contrib="yes">
<name><surname>Taniguchi</surname> <given-names>Tadahiro</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="c001"><sup>&#x0002A;</sup></xref>
<xref ref-type="author-notes" rid="fn001"><sup>&#x02020;</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/379696/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Hagiwara</surname> <given-names>Yoshinobu</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/424583/overview"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Taniguchi</surname> <given-names>Akira</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://loop.frontiersin.org/people/458720/overview"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Graduate School of Information Science and Engineering, Ritsumeikan University</institution>, <addr-line>Kusatsu</addr-line>, <country>Japan</country></aff>
<aff id="aff2"><sup>2</sup><institution>College of Information Science and Engineering, Ritsumeikan University</institution>, <addr-line>Kusatsu</addr-line>, <country>Japan</country></aff>
<aff id="aff3"><sup>3</sup><institution>Research Organization of Science and Technology, Ritsumeikan University</institution>, <addr-line>Kusatsu</addr-line>, <country>Japan</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Reiji Suzuki, Nagoya University, Japan</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Kazuki Miyazawa, Osaka University, Japan; Kei Wakabayashi, University of Tsukuba, Japan</p></fn>
<corresp id="c001">&#x0002A;Correspondence: Tadahiro Taniguchi <email>taniguchi&#x00040;em.ci.ritsumei.ac.jp</email></corresp>
<fn fn-type="equal" id="fn001"><p>&#x02020;These authors have contributed equally to this work and share first authorship</p></fn></author-notes>
<pub-date pub-type="epub">
<day>05</day>
<month>12</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>6</volume>
<elocation-id>1235231</elocation-id>
<history>
<date date-type="received">
<day>05</day>
<month>06</month>
<year>2023</year>
</date>
<date date-type="accepted">
<day>13</day>
<month>11</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2023 Okumura, Taniguchi, Hagiwara and Taniguchi.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Okumura, Taniguchi, Hagiwara and Taniguchi</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>We explore the emergence of symbols during interactions between individuals through an experimental semiotic study. Previous studies have investigated how humans organize symbol systems through communication using artificially designed subjective experiments. In this study, we focused on a joint-attention-naming game (JA-NG) in which participants independently categorized objects and assigned names while assuming their joint attention. In the Metropolis-Hastings naming game (MHNG) theory, listeners accept provided names according to the acceptance probability computed using the Metropolis-Hastings (MH) algorithm. The MHNG theory suggests that symbols emerge as an approximate decentralized Bayesian inference of signs, which is represented as a shared prior variable if the conditions of the MHNG are satisfied. This study examines whether human participants exhibit behavior consistent with the MHNG theory when playing the JA-NG. By comparing human acceptance decisions of a partner&#x00027;s naming with acceptance probabilities computed in the MHNG, we tested whether human behavior is consistent with the MHNG theory. The main contributions of this study are twofold. First, we reject the null hypothesis that humans make acceptance judgments with a constant probability, regardless of the acceptance probability calculated by the MH algorithm. The results of this study show that the model with acceptance probability computed by the MH algorithm predicts human behavior significantly better than the model with a constant probability of acceptance. Second, the MH-based model predicted human acceptance/rejection behavior more accurately than four other models (i.e., Constant, Numerator, Subtraction, Binary). Among the models compared, the model using the MH algorithm, which is the only model with the mathematical support of decentralized Bayesian inference, predicted human behavior most accurately, suggesting that symbol emergence in the JA-NG can be explained by the MHNG.</p></abstract>
<kwd-group>
<kwd>symbol emergence</kwd>
<kwd>experimental semiotics</kwd>
<kwd>naming game</kwd>
<kwd>probabilistic generative models</kwd>
<kwd>Bayesian inference</kwd>
</kwd-group>
<contract-num rid="cn001">17H06379</contract-num>
<contract-num rid="cn001">21H04904</contract-num>
<contract-sponsor id="cn001">Japan Society for the Promotion of Science<named-content content-type="fundref-id">10.13039/501100001691</named-content></contract-sponsor>
<counts>
<fig-count count="9"/>
<table-count count="8"/>
<equation-count count="13"/>
<ref-count count="38"/>
<page-count count="15"/>
<word-count count="8403"/>
</counts>
<custom-meta-wrap>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Language and Computation</meta-value>
</custom-meta>
</custom-meta-wrap>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<title>1 Introduction</title>
<p>Humans can create and communicate through symbol systems that involve assigning meanings to signs. This semiotic process does not rely on predetermined definitions of the meanings of the symbols but rather emerges gradually through semiotic communication and perceptual experiences. This phenomenon is known as symbol emergence (Taniguchi et al., <xref ref-type="bibr" rid="B35">2016</xref>, <xref ref-type="bibr" rid="B37">2018</xref>). Understanding the cognitive capabilities and the social and cognitive dynamics that support symbol emergence is crucial in comprehending the dynamic property of language.</p>
<p>Numerous experimental semiotic studies have been conducted to investigate how humans organize symbol systems through communication (Galantucci, <xref ref-type="bibr" rid="B9">2005</xref>; Healey et al., <xref ref-type="bibr" rid="B15">2007</xref>; Scott-Phillips et al., <xref ref-type="bibr" rid="B29">2009</xref>). These studies demonstrated that humans can build communication systems from scratch (Quinn, <xref ref-type="bibr" rid="B26">2001</xref>; Galantucci, <xref ref-type="bibr" rid="B9">2005</xref>; Healey et al., <xref ref-type="bibr" rid="B15">2007</xref>; Scott-Phillips et al., <xref ref-type="bibr" rid="B29">2009</xref>; Roberts, <xref ref-type="bibr" rid="B28">2010</xref>). Additionally, computational-model-based studies in experimental semiotics, such as those by Kirby et al. (<xref ref-type="bibr" rid="B19">2008</xref>), Cornish (<xref ref-type="bibr" rid="B5">2010</xref>); and Navarro et al. (<xref ref-type="bibr" rid="B25">2018</xref>) validate the effectiveness of iterated learning models. Iterated learning is a process in which an individual acquires a behavior by observing a similar behavior in another individual who acquired it in the same way (Kirby et al., <xref ref-type="bibr" rid="B19">2008</xref>). However, iterated learning is not an explanatory principle that answers the question of whether the emergence of a symbol system improves the environmental adaptation of a group of agents. Iterated learning does not have a theoretical connection to explanatory theories about human perceptual systems. By contrast, symbol emergence based on the Metropolis-Hastings naming game (MHNG), which is the focus of this study, is closely related to predictive coding and free-energy principle (Friston, <xref ref-type="bibr" rid="B7">2010</xref>; Hohwy, <xref ref-type="bibr" rid="B16">2013</xref>; Friston et al., <xref ref-type="bibr" rid="B8">2021</xref>), which are often referred to as the general principle of cognition. In this context, Taniguchi et al. hypothesized that symbol emergence could be viewed as a collective predictive coding by a group of agents (Taniguchi, <xref ref-type="bibr" rid="B34">2023</xref>; Taniguchi et al., <xref ref-type="bibr" rid="B38">2023</xref>).</p>
<p>Many studies focused on computational models that represent symbol emergence systems. Pioneering studies have used naming games, in which remote robots share symbols to represent objects and variants of referential games (Cangelosi and Parisi, <xref ref-type="bibr" rid="B3">1998</xref>; Steels, <xref ref-type="bibr" rid="B30">1999</xref>, <xref ref-type="bibr" rid="B31">2015</xref>; Kirby, <xref ref-type="bibr" rid="B18">2002</xref>). More recently, deep-learning-based referential games have been extensively used to study emergent communication (Havrylov and Titov, <xref ref-type="bibr" rid="B14">2017</xref>; Lazaridou et al., <xref ref-type="bibr" rid="B22">2017</xref>; Evtimova et al., <xref ref-type="bibr" rid="B6">2018</xref>; Bouchacourt and Baroni, <xref ref-type="bibr" rid="B2">2019</xref>). Referential and naming games, often referred to as variants of the Lewis-style signaling game, have also been used to achieve compositionality in languages (Kottur et al., <xref ref-type="bibr" rid="B20">2017</xref>; Choi et al., <xref ref-type="bibr" rid="B4">2018</xref>; Ren et al., <xref ref-type="bibr" rid="B27">2020</xref>; Mu and Goodman, <xref ref-type="bibr" rid="B24">2021</xref>). Generally, in these games, a speaker sends a message to a listener who indicates the object intended by the speaker. After the communication, reward feedback is provided to the agents, and they update their parameters. The reward feedback precedes joint attention in this approach.</p>
<p>However, in the development of human infants, joint attention, which is acquired at around nine months of age, is well-known to precede tremendous progress in lexical acquisition and language development. Another notable concept is the naming game based on joint attention and the associated theoretical basis, called MHNG, in which each agent independently forms categories and shares signs associated with those categories through communication in the joint-attention naming game (JA-NG) (Hagiwara et al., <xref ref-type="bibr" rid="B12">2019</xref>). This theory suggests that symbol emergence can be viewed as the approximate decentralized Bayesian inference of a posterior distribution over a shared latent variable conditioned on the observations of all agents participating in the communication. However, previous studies on experimental semiotics (Kirby et al., <xref ref-type="bibr" rid="B19">2008</xref>; Cornish, <xref ref-type="bibr" rid="B5">2010</xref>; Navarro et al., <xref ref-type="bibr" rid="B25">2018</xref>) did not employ computational models that incorporate decentralized Bayesian inference over the entire system, including multiple agents.</p>
<p>In this study, our objective is to investigate whether the MHNG, which models symbol emergence as a decentralized Bayesian inference (Hagiwara et al., <xref ref-type="bibr" rid="B12">2019</xref>; Taniguchi et al., <xref ref-type="bibr" rid="B38">2023</xref>), can serve as a valid explanatory principle of symbol emergence between human individuals. MHNG involves computational agents playing the JA-NG, where agents independently form categories of objects and name them while assuming joint attention. Unlike the widely used Lewis signaling games (Lewis, <xref ref-type="bibr" rid="B23">2008</xref>), the JA-NG does not involve any explicit reward feedback from the opponent after the naming process. In the MHNG, each agent decides whether to accept another agent&#x00027;s naming based on a probabilistic criterion calculated using the Metropolis-Hastings (MH) algorithm (Hastings, <xref ref-type="bibr" rid="B13">1970</xref>). Consequently, symbol emergence occurs through a decentralized Bayesian inference.</p>
<p>Suppose people in the JA-NG follow a similar acceptance probability as observed in the MHNG. In this case, it can be inferred that they perform decentralized Bayesian inference as a whole system that includes multiple individuals involved in the emergence of symbols. The MHNG is a computational model in which agents play joint-attention naming games, and it uses the acceptance probability based on the MH algorithm to determine whether a listener agent accepts an incoming name proposed by another agent. Testing the hypothesis that humans use MH-based criteria to determine the acceptance of new names in the JA-NG is crucial to demonstrating the validity of the MHNG as an explanatory principle. If humans exhibit a behavior similar to that of the MHNG, their acceptance rate of incoming names should be correlated with the probability calculated using the MH algorithm. Thus, it can be concluded that humans make acceptance or rejection judgments in communication, following the MHNG principles to some extent. However, whether humans employ the same acceptance/rejection assessments in similar settings remains unclear.</p>
<p>This study aims to verify whether humans engage in decentralized Bayesian inference by conducting subject experiments similar to the JA-NG. We performed a communication experiment with human participants. The communication structure in the experiment resembled that of the JA-NG in a simulation experiment conducted by Hagiwara et al. (<xref ref-type="bibr" rid="B12">2019</xref>). We observed the acceptance or rejection assessments of participants and tested whether they used the acceptance probability calculated by the MHNG theory to a certain extent. Additionally, we evaluated whether the computational model using the MH algorithm predicted human behavior more accurately than four other comparative models: Constant, Numerator, Subtraction, and Binary.</p>
<p>The main contributions of this study are as follows:</p>
<list list-type="bullet">
<list-item><p>We verify whether human participants playing the JA-NG use the acceptance probability computed in the model based on the MH algorithm to a certain extent.</p></list-item>
<list-item><p>We demonstrate that the model based on the MH algorithm outperforms the other four comparative computational models in predicting the acceptance behavior of participants in the JA-NG.</p></list-item>
</list>
<p>Statistical tests were conducted to examine our hypotheses. The results showed that the acceptance behavior of the human participants in the JA-NG can be modeled using the MH algorithm.</p>
<p>The remainder of this article is organized as follows. The next section provides an overview of the computational theory underlying this study. We then describe the setup of the communication experiment as well as the analysis and statistical test procedures in the Materials and Methods Section. The Results and Discussion Section presents our findings and corresponding interpretations. The final section concludes the article.</p>
</sec>
<sec id="s2">
<title>2 Preliminaries</title>
<p>In this section, we describe the JA-NG performed in the subject experiments and the interpersonal Gaussian mixture (Inter-GM), which is the assumed probabilistic model for analyzing the results of the subject experiments. Additionally, we describe the general interpersonal probabilistic generative model (Inter-PGM), whose concrete instance is Inter-GM, and the MHNG in which agents play the JA-NG using a specific acceptance probability based on the MH algorithms.</p>
<p><xref ref-type="fig" rid="F1">Figure 1</xref> illustrates the correspondence between the computational model (i.e., Inter-GM) and the communication experiment.</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p>Illustration of the relationship between the communication game in the experiment and the probabilistic graphical model of the Inter-GM. The color images observed by the participants are labeled as <inline-formula><mml:math id="M1"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M2"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, with the corresponding color classification results represented by <inline-formula><mml:math id="M3"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M4"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. The images of the subjects are named by sampling a shared sign <inline-formula><mml:math id="M5"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, with signs sampled for the <italic>n</italic>-th object by A and B, which are labeled as <inline-formula><mml:math id="M6"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M7"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, respectively. The red balloon is the sampled sign of A and the blue one is the sampled sign of B. The transmission of the sign through naming is depicted by the dashed red and blue lines. The variable &#x00398;<sup>&#x0002A;</sup> consists of <italic>L</italic> elements, specifically denoted as <inline-formula><mml:math id="M8"><mml:mrow><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. Similarly, the variable &#x003A6;<sup>&#x0002A;</sup> encompasses <italic>K</italic> paired elements, with each pair consisting of <inline-formula><mml:math id="M9"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math id="M10"><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>, represented as <inline-formula><mml:math id="M11"><mml:mrow><mml:msup><mml:mrow><mml:mo>&#x003A6;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0001.tif"/>
</fig>
<sec>
<title>2.1 Joint-attention naming game</title>
<p>Two agents <italic>A</italic> and <italic>B</italic> play the JA-NG as detailed here. Specific variables are introduced in the following subsection.</p>
<list list-type="order">
<list-item><p>Perception: Both the speaker and listener observe an object and update their perceptual state, such as a categorization result corresponding to the object based on their respective observations, assuming joint attention where two agents are looking at the same object.</p></list-item>
<list-item><p>Communication: The speaker gives the name to the object based on its perceptual state (e.g., the categorization result, and its own knowledge). The listener decides whether to accept the name.</p></list-item>
<list-item><p>Learning: After communication, the categorization results and knowledge are updated based on the results of the communication.</p></list-item>
<list-item><p>Turn-taking: The speaker and listener alternate their roles and repeat the above steps for all objects.</p></list-item>
</list>
<p>The JA-NG is a procedural description of the interaction between two agents and their learning process through the sharing of semiotic knowledge between them based on joint attention.</p>
</sec>
<sec>
<title>2.2 Inter-PGM and MH naming game</title>
<p>We first define the variables related to the JA-NG and assume a conditional dependency between the variables by defining the Inter-PGM (<xref ref-type="fig" rid="F2">Figure 2</xref>). <xref ref-type="table" rid="T1">Table 1</xref> is an explanation of the variables in the Inter-PGM. An Inter-PGM is a general form of PGM that models symbol emergence using the JA-NG.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p><bold>(Left)</bold> Probabilistic graphical model of the Inter-PGM. <bold>(Right)</bold> Decomposed illustration of the Inter-PGM.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0002.tif"/>
</fig>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p>Variables of the Inter-PGM and their explanations.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold>Variable</bold></th>
<th valign="top" align="left"><bold>Explanation</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left"><italic>s</italic><sub><italic>n</italic></sub></td>
<td valign="top" align="left">A sign, e.g., a name, for the <italic>n</italic>-th object</td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math id="M12"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
<td valign="top" align="left">Perceptual state corresponding to the <italic>n</italic>-th object</td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math id="M13"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
<td valign="top" align="left">Observation for the <italic>n</italic>-th object</td>
</tr>
<tr>
<td valign="top" align="left">&#x00398;<sup>&#x0002A;</sup></td>
<td valign="top" align="left">Parameter about the relations between signs and perceptual states</td>
</tr>
<tr>
<td valign="top" align="left">&#x003A6;<sup>&#x0002A;</sup></td>
<td valign="top" align="left">Parameter about the relations between perceptual states and observations</td>
</tr>
<tr>
<td valign="top" align="left">&#x003B1;</td>
<td valign="top" align="left">A hyperparameter for &#x00398;<sup>&#x0002A;</sup></td>
</tr>
<tr>
<td valign="top" align="left">&#x003B2;</td>
<td valign="top" align="left">A hyperparameter for &#x003A6;<sup>&#x0002A;</sup></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>Superscript &#x0002A;&#x02208;{<italic>A, B</italic>} refers to a specific agent.</p>
</table-wrap-foot>
</table-wrap>
<p>The probability variables related to the JA-NG can be described using a probabilistic graphical model, as shown in <xref ref-type="fig" rid="F2">Figure 2</xref>.</p>
<p>The generative process of the Inter-PGM is as follows:</p>
<disp-formula id="E1"><label>(1)</label><mml:math id="M14"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:mi>&#x003B3;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E2"><label>(2)</label><mml:math id="M15"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup><mml:mo>&#x02223;</mml:mo><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E3"><label>(3)</label><mml:math id="M16"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mo>&#x003A6;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>&#x003A6;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup><mml:mo>&#x02223;</mml:mo><mml:mi>&#x003B2;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E4"><label>(4)</label><mml:math id="M17"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E5"><label>(5)</label><mml:math id="M18"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A6;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>where <inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the observed information, <inline-formula><mml:math id="M20"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the category to which <inline-formula><mml:math id="M21"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> is classified, that is, perceptual state, and <inline-formula><mml:math id="M22"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> represents the sign of <inline-formula><mml:math id="M23"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, and &#x0002A;&#x02208;{<italic>A, B</italic>}.</p>
<p>A PGM can be decomposed into two parts corresponding to the two agents using the Neuro-SERKET framework (Taniguchi et al., <xref ref-type="bibr" rid="B36">2020</xref>) in the inference process. found that a certain type of language game can be regarded as a decentralized inference process for an Inter-PGM, and Taniguchi et al. (<xref ref-type="bibr" rid="B38">2023</xref>) formulated this idea as the MHNG.</p>
<p>The MH naming game is a special case of the JA-NG (Taniguchi et al., <xref ref-type="bibr" rid="B38">2023</xref>). The JA-NG becomes the MHNG upon satisfying the following conditions:</p>
<list list-type="order">
<list-item><p>The speaker (<italic>Sp</italic>) selects the name <inline-formula><mml:math id="M24"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> by sampling from the posterior distribution <inline-formula><mml:math id="M25"><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p>The listener (<italic>Li</italic>) determines acceptance of sign <inline-formula><mml:math id="M26"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> using the probability <inline-formula><mml:math id="M27"><mml:mrow><mml:msup><mml:mi>r</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mi>min</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mo>&#x00398;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x022C6;</mml:mo></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mo>&#x00398;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p></list-item>
<list-item><p>The agents update its internal variables <inline-formula><mml:math id="M28"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mo>&#x003A6;</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula> using Bayesian inference appropriately.</p></list-item>
</list>
<p>It is theoretically guaranteed that the MHNG is an approximate decentralized Bayesian inference of shared representations, that is, <inline-formula><mml:math id="M29"><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>A</mml:mi></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>B</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> and the internal representations and the knowledge of each agent. Specifically, internal representations are characterized by the local parameters <inline-formula><mml:math id="M30"><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>, while knowledge is defined by the global parameters &#x00398;<sup>&#x0002A;</sup> and &#x003A6;<sup>&#x0002A;</sup> in <xref ref-type="fig" rid="F2">Figure 2</xref>. These global parameters represent the relationship between observations and internal representations, and the relationship between names and internal representations, respectively. For more details, please refer to the original article (Taniguchi et al., <xref ref-type="bibr" rid="B38">2023</xref>).</p>
</sec>
<sec>
<title>2.3 Interpersonal Gaussian mixture</title>
<p>We used Inter-GM, which was tailored to fit the observations, that is, the color information used in our experiment. Hagiwara et al. (<xref ref-type="bibr" rid="B12">2019</xref>, <xref ref-type="bibr" rid="B11">2022</xref>) proposed inter-DM and inter-MDM models in which agents observed bag-of-features representations, that is, histograms. They formed individual categories using a Dirichlet mixture and shared signs linked to the formed categories through communication. Inter-GM is a modified version of inter-DM in which the part that formed categories using a Dirichlet mixture is replaced by a Gaussian mixture for categorizing multidimensional continuous real-valued vectors.</p>
<p>The Inter-GM generative process is as follows:</p>
<disp-formula id="E6"><label>(6)</label><mml:math id="M31"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mtext>Cat</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:mi>&#x003C0;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E7"><label>(7)</label><mml:math id="M32"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mrow><mml:mi mathvariant="script">N</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x003B2;</mml:mi><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="script">W</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:mi>&#x003BD;</mml:mi><mml:mo>,</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E8"><label>(8)</label><mml:math id="M33"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mtext>Dir</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:mi>&#x003B1;</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>L</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E9"><label>(9)</label><mml:math id="M34"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mtext>Cat</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="E10"><label>(10)</label><mml:math id="M35"><mml:mtable class="eqnarray" columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mo>&#x0007E;</mml:mo><mml:mrow><mml:mi mathvariant="script">N</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x02003;</mml:mtext><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Cat(&#x0002A;) is the categorical distribution, <inline-formula><mml:math id="M36"><mml:mrow><mml:mi mathvariant="script">N</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> is the Gaussian distribution, <inline-formula><mml:math id="M37"><mml:mrow><mml:mi mathvariant="script">W</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> is the Wishart distribution, and Dir(&#x0002A;) is the Dirichlet distribution. The parameters for the Gaussian mixture model (GMM) <inline-formula><mml:math id="M38"><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> correspond to &#x003A6;<sup>&#x0002A;</sup> and <inline-formula><mml:math id="M39"><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> corresponds to &#x00398;<sup>&#x0002A;</sup> in Inter-PGM (<xref ref-type="fig" rid="F2">Figure 2</xref>) respectively.</p>
<p>In the MHNG, after observing (or sampling) <inline-formula><mml:math id="M40"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, the probabilistic variables for each agent become independent, and the parameters for each agent can be inferred using ordinal approximate Bayesian inference schemes. We applied Gibbs sampling, a widely used Markov chain Monte Carlo approximate Bayesian inference procedure (Bishop and Nasrabadi, <xref ref-type="bibr" rid="B1">2006</xref>), to sample the parameters <inline-formula><mml:math id="M41"><mml:msubsup><mml:mrow><mml:mi>&#x003BC;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, <inline-formula><mml:math id="M42"><mml:msubsup><mml:mrow><mml:mo>&#x0039B;</mml:mo></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, <inline-formula><mml:math id="M43"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>, and &#x00398;<sup>&#x0002A;</sup>.</p>
<p>In the MHNG, the sign <italic>s</italic><sub><italic>n</italic></sub> is inferred by agents A and B through an alternative sampling of the sign <italic>s</italic><sub><italic>n</italic></sub> from each other, and acceptance based on the acceptance probability of the MH algorithm <inline-formula><mml:math id="M44"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>min</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mo>&#x00398;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x022C6;</mml:mo></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mo>&#x00398;</mml:mo><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> for the sign of the other agent where <inline-formula><mml:math id="M45"><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>&#x003B8;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>L</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is inferred using <inline-formula><mml:math id="M46"><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and <inline-formula><mml:math id="M47"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>.</p>
<p>The acceptance probability estimated from the categorization results (see <xref ref-type="fig" rid="F3">Figure 3</xref>) and the actual acceptance/rejection decisions were recorded to investigate whether humans accept the proposals of their opponents based on the MH acceptance probability. The parameters &#x00398;<sup>&#x0002A;</sup> and &#x003A6;<sup>&#x0002A;</sup> are inferred through Gibbs sampling using the categorization <inline-formula><mml:math id="M48"><mml:msub><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> provided by the participants, along with their names <inline-formula><mml:math id="M49"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> and original observations <inline-formula><mml:math id="M50"><mml:msubsup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x0002A;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula>. The MH acceptance probability <inline-formula><mml:math id="M51"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is then calculated, where <inline-formula><mml:math id="M52"><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the proposal of the opponent.</p>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p>Flow of the subject experiment. In (1) categorization, participants categorize the given image. In (2) naming game, the speaker names the image by selecting any name from A to E, and the listener, decides whether to accept or reject the proposed name by pressing a button. Participants repeat the process, switching between the roles of speaker and listener.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0003.tif"/>
</fig>
</sec>
</sec>
<sec sec-type="materials and methods" id="s3">
<title>3 Materials and methods</title>
<sec>
<title>3.1 Communication experiment</title>
<p>To investigate whether the acceptance of the speaker&#x00027;s proposals by a listener aligns with the acceptance probability calculated by the MH algorithm <inline-formula><mml:math id="M53"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, we performed a communication experiment with human participants. Instead of the computational experiment described in Hagiwara et al. (<xref ref-type="bibr" rid="B12">2019</xref>), we performed a communication experiment with human participants that followed a methodology similar to that of experimental semiotics.</p>
<p>The experiment was conducted in pairs, referred to as participants A and B. Each pair followed the procedure outlined in <xref ref-type="fig" rid="F3">Figure 3</xref> and used separate personal computers (PCs). Participants were in different rooms and were not permitted to communicate directly using any alternative communication media.</p>
<p><xref ref-type="fig" rid="F4">Figure 4</xref> shows the user interface of the experimental application. (1) in <xref ref-type="fig" rid="F4">Figure 4</xref> shows the category classification screen that the participants first encountered, (2) shows the screen for the name, and (3) shows the screen for the listener. The procedure is detailed below.</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p>Screenshots of the experimental application in operation. (1) a view of the initial categorization phase, (2) the view of the speaker in the naming phase, and (3) the view of the listener when the listener receives a name for a color patch.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0004.tif"/>
</fig>
<p>Before starting the communication, each participant was instructed to classify 15 images into categories labeled A&#x02013;E (<bold>initialization</bold>).</p>
<list list-type="order">
<list-item><p><bold>Perception</bold>: An image used in the initialization step is displayed to a speaker. In the experiment, the participants were asked to exhibit their perceptual state as a categorization result [(1) Categorization in <xref ref-type="fig" rid="F3">Figure 3</xref>].</p></list-item>
<list-item><p><bold>Communication</bold>: The speaker names the image by selecting any name from A to E. Participant B, the listener, decides whether to accept or reject the proposed name by pressing a button.</p></list-item>
<list-item><p><bold>Learning</bold> (update categories and sign allocation): Participant B, as the listener, can modify their classification result after the acceptance/rejection decision.</p></list-item>
<list-item><p><bold>Turn-taking</bold>: Steps from 1 to 3 correspond to (2) naming game as shown in <xref ref-type="fig" rid="F3">Figure 3</xref>, and this game is repeated with participants switching their roles.</p></list-item>
</list>
<p>During the experiment, the participants repeated steps 2&#x02013;4 15 times for each data sample, and the process was done three times. Therefore, each participant made 45 acceptance or rejection decisions per dataset.</p>
<p>The communication process involved proposing and accepting/rejecting names in steps 1 and 2. Each communication was completed when step 2 ended and the results were recorded each time. Participants could modify their classification results whenever desired; however, a prompt appeared if they attempted to alter the result after accepting/rejecting the proposal of their partner when playing the role of the listener. The participant pairs were housed in separate rooms, and the classification and communication were performed on PCs using a Python application, which communicated with the other PCs. The PCs used were 13-inch MacBooks. The brightness of the PCs was automatically adjusted to account for the possibility of different ambient lighting in each room. The images were presented in random order because the same images were used even after switching roles in step 3. <xref ref-type="fig" rid="F5">Figure 5</xref> shows a photograph of an actual experiment. Participants were given the following instructions:</p>
<list list-type="bullet">
<list-item><p>Work collaboratively with your counterpart to improve classification accuracy through interactions.</p></list-item>
<list-item><p>Sharing names is crucial for effective communication.</p></list-item>
<list-item><p>When you receive naming suggestions from your counterpart, decide whether to accept their naming or stick with your own to improve classification accuracy.</p></list-item>
</list>
<fig id="F5" position="float">
<label>Figure 5</label>
<caption><p>State of the actual experiment. The two participants used different PCs and were housed in separate rooms, and they communicated using socket communication.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0005.tif"/>
</fig>
</sec>
<sec>
<title>3.2 Computational model for analysis</title>
<p>We used the Inter-GM described in the Preliminaries section to analyze the behavioral data and predict the acceptance rate of the participants.</p>
<p>The hyperparameters used for the Inter-GM were <italic>&#x003B1;</italic> &#x0003D; (0.1, 0.1, 0.1, 0.1, 0.1)<sup>T</sup>, <italic>&#x003B2;</italic> &#x0003D; 1.0, <italic>m</italic> &#x0003D; (50, 0, 0)<sup>T</sup>, <inline-formula><mml:math id="M54"><mml:msup><mml:mrow><mml:mi>W</mml:mi></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="true">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>200</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>200</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>200</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="true">)</mml:mo></mml:mrow></mml:math></inline-formula>, <italic>&#x003C0;</italic> &#x0003D; (1/5, 1/5, 1/5, 1/5, 1/5)<sup>T</sup>, in an empirical manner.</p>
</sec>
<sec>
<title>3.3 Materials</title>
<p>For the experiment, 20 participants were recruited, forming 10 pairs. The female-to-male ratio was 6:14, and the minimum and maximum ages were 21 and 59, respectively. As the experiment used colors, the participants were verbally asked whether they were colorblind to ensure that colorblind participants were not included in the experiment. The study was initiated on 27 July 2022, and the recruitment of participants commenced on 15 December 2022. The experiment took place from 20 December 2022 to 25 January 2023. Throughout this period, the authors created and maintained the experimental data of the participants and correspondence tables. It is important to note that the correspondence tables were not accessed or used during the data analysis stage.</p>
<p>This study was approved by the Research Ethics Committee of Ritsumeikan University under approval number BKC-LSMH-2022-012. All the participants provided informed consent before participation.</p>
<p>To generate color images as stimuli, the CIE-<italic>L</italic><sup>&#x0002A;</sup><italic>U</italic><sup>&#x0002A;</sup><italic>V</italic><sup>&#x0002A;</sup> color space, which accurately represents the psychological distance perceived by humans, was used (Steels et al., <xref ref-type="bibr" rid="B32">2005</xref>). In the CIE-<italic>L</italic><sup>&#x0002A;</sup><italic>U</italic><sup>&#x0002A;</sup><italic>V</italic><sup>&#x0002A;</sup> color space, <italic>L</italic><sup>&#x0002A;</sup> represents brightness and <italic>U</italic><sup>&#x0002A;</sup><italic>V</italic><sup>&#x0002A;</sup> represents hue. The details of the color images were as follows: (1) Pillow (PIL), a Python image processing library, was used to create images of colored circles<xref ref-type="fn" rid="fn0001"><sup>1</sup></xref>. (2) <italic>L</italic><sup>&#x0002A;</sup>, <italic>U</italic><sup>&#x0002A;</sup>, and <italic>V</italic><sup>&#x0002A;</sup> were sampled from three three-dimensional Gaussian distributions. (3) Two datasets, <bold>hard</bold> and <bold>easy</bold>, were prepared to observe the differences in communication according to difficulty levels: Dataset 1 was difficult to classify, and Dataset 2 was easy to classify. (4) The same images were shown to both participants and each dataset contained 15 images. (5) The Gaussian distribution to sample from was determined using a uniform distribution.</p>
<p><xref ref-type="table" rid="T2">Table 2</xref> lists the parameters for each Gaussian distribution. Each data point in the three-dimensional CIE-<italic>L</italic><sup>&#x0002A;</sup><italic>U</italic><sup>&#x0002A;</sup><italic>V</italic><sup>&#x0002A;</sup> color space was generated from a three-dimensional Gaussian distribution. <xref ref-type="fig" rid="F6">Figure 6</xref> shows images of Dataset 1 (<bold>hard</bold>), and Dataset 2 (<bold>easy</bold>).</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p>Parameters of the three Gaussian distributions generating the color patches used in the experiment.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th/>
<th valign="top" align="center"><bold>Dataset 1 (hard)</bold></th>
<th valign="top" align="center"><bold>Dataset 2 (easy)</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">&#x003BC;<sub>1</sub></td>
<td valign="top" align="center"><inline-formula><mml:math id="M62"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>60</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:mn>10</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>20</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math id="M63"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>60</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>30</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>30</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">&#x003BC;<sub>2</sub></td>
<td valign="top" align="center"><inline-formula><mml:math id="M64"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>60</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:mn>20</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:mn>10</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math id="M65"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>60</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>30</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:mn>30</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">&#x003BC;<sub>3</sub></td>
<td valign="top" align="center"><inline-formula><mml:math id="M66"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>60</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>20</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>10</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math id="M67"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:mn>60</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:mn>30</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>-</mml:mo><mml:mn>30</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">&#x003A3;</td>
<td valign="top" align="center"><inline-formula><mml:math id="M68"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:msup><mml:mrow><mml:mn>9</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:msup><mml:mrow><mml:mn>9</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math id="M69"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtable style="text-align:axis;" equalrows="false" columnlines="none none none none none none none none none" equalcolumns="false" class="array"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn><mml:msup><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn><mml:msup><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr></tbody>
</table>
<table-wrap-foot>
<p>&#x003BC;<sub><italic>k</italic></sub> is the mean vector of the <italic>k</italic>-th three-dimensional Gaussian distribution. &#x003A3; &#x0003D; &#x0039B;<sup>&#x02212;1</sup> is the covariance matrix that is shared among the three Gaussian distributions.</p>
</table-wrap-foot>
</table-wrap>
<fig id="F6" position="float">
<label>Figure 6</label>
<caption><p>Images used in the communication experiment. The left image is Dataset 1 (hard), and the right image is Dataset 2 (easy). The images in the same row are generated from the same Gaussian distribution, and the numbers represent the Gaussian distribution number.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0006.tif"/>
</fig>
</sec>
<sec>
<title>3.4 Hypothesis testing 1</title>
<p>We investigated whether the decisions of people are affected by their acceptance probability using the acceptance probability based on the MH algorithm, although the decision does not completely comply with the theory. To investigate whether humans use the MH-based acceptance probability to a certain extent, that is, whether the actual acceptance probability correlates with the MH-based acceptance probability, we defined a biased Bernoulli distribution, <inline-formula><mml:math id="M55"><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. The Bernoulli distribution, Bern(<italic>z</italic>&#x02223;<italic>r</italic>), samples one with probability <italic>r</italic> and zero with probability 1&#x02212;<italic>r</italic>. The weight parameter <italic>a</italic>, indicating the extent to which the inferred acceptance probability is used, and bias parameter <italic>b</italic>, indicating the degree to which acceptance occurs unconditionally, were used and estimated. If <italic>a</italic> &#x0003D; 1 and <italic>b</italic> &#x0003D; 0, the distribution becomes the original MH-based acceptance probability distribution, <inline-formula><mml:math id="M56"><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. Specifically, variable <italic>z</italic><sub><italic>n</italic></sub> represents whether the participant accepted the given name, taking the value of 1 if accepted and 0 if rejected. The acceptance probability of a participant is denoted by <italic>r</italic><sub><italic>n</italic></sub>.</p>
<p>The linear transformation was introduced to account for external social and cognitive factors that might affect acceptance probability. While the MHNG theory focuses on perceptual states and their relationship to signs, as shown in <xref ref-type="fig" rid="F1">Figure 1</xref>, it does not consider other social or cognitive influences on acceptance probability. Factors such as respect for a counterpart or an authority gradient (Gluyas, <xref ref-type="bibr" rid="B10">2015</xref>) could make it easier to accept another&#x00027;s proposal. Notably, to reduce the influence of these factors during the experiment, we conducted sessions with participants in separate rooms, ensuring that they could not see each other.</p>
<p>We tested the estimated parameter <italic>a</italic>, which model the relationship between the actual acceptance probability and MH-based acceptance probability <inline-formula><mml:math id="M57"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. For acceptance and rejection, we assumed 1 and 0, respectively. Instead of calculating the correlation between the acceptance/rejection decision and <italic>r</italic><sub><italic>n</italic></sub>, we used a conditional Bernoulli distribution.</p>
<p>Parameters <italic>a</italic> and <italic>b</italic> were determined using the maximum likelihood estimation. The maximum log-likelihood estimation of parameters <italic>a</italic> and <italic>b</italic> was performed using gradient descent. The original likelihood function is defined as</p>
<disp-formula id="E11"><mml:math id="M58"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:mi>L</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x0220F;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover></mml:mstyle><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>To avoid the Bern parameter from going outside the domain, <italic>a</italic> and <italic>b</italic> were bounded to 0 &#x02264; <italic>b</italic> and <italic>a</italic>&#x0002B;<italic>b</italic> &#x02264; 1, respectively.</p>
<p>A hypothesis test was performed to test the statistical significance of the association between the <inline-formula><mml:math id="M59"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> score and acceptance decisions made by human participants.</p>
<p>The null hypothesis <italic>H</italic><sub>0</sub> and alternative hypothesis <italic>H</italic><sub>1</sub> are as follows:</p>
<list list-type="bullet">
<list-item><p><italic>H</italic><sub>0</sub>: There is no association between the acceptance decision and <inline-formula><mml:math id="M60"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, the MH-based acceptance probability. In other words, the human acceptance probability remains constant with respect to <inline-formula><mml:math id="M61"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>.</p></list-item>
<list-item><p><italic>H</italic><sub>1</sub>: The acceptance probability is not constant, indicating that the acceptance probabilities calculated by the MH algorithm are more predictive of human judgment than random acceptance probabilities.</p></list-item>
</list>
<p>The test statistic is the coefficient of a (bounded) linear function that parameterizes the Bernoulli distribution and the acceptance probability as output. The test statistic was set as the coefficient of the regression fitted to the observed data &#x000E2;.</p>
<p>To estimate the sampling distribution of the test statistic, we used a randomized approach in which we randomly generated Bernoulli random variables with a fixed parameter and then fitted a linear model to obtain the coefficient <italic>a</italic> (i.e., the test statistic) from the null hypothesis<xref ref-type="fn" rid="fn0002"><sup>2</sup></xref>. The acceptance and rejection decisions were randomly sampled from the distribution by assuming <italic>H</italic><sub>0</sub>, that is, <inline-formula><mml:math id="M70"><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0007E;</mml:mo><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x02223;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. The null distribution of the test statistics was estimated and the <italic>p</italic>-values were empirically calculated. By performing this 1,000 times, we obtained an estimate of the sampling distribution as a histogram, which we used to compute the <italic>p</italic>-value as the tail probability. <inline-formula><mml:math id="M71"><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> was determined from the behavior of all subjects using maximum likelihood estimation.</p>
<p>By assuming that the acceptance events occur with probability <italic>r</italic><sub><italic>n</italic></sub>, we can compute the likelihood by fitting them to the Bernoulli distribution and multiplying them by the total number of given names <italic>N</italic>; that is, <inline-formula><mml:math id="M72"><mml:mi>L</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mo>&#x0220F;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:msubsup><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msub><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0002B;</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></p>
<p>We performed sampling using <inline-formula><mml:math id="M73"><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover><mml:mo>&#x02223;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> to obtain lists of test statistics <italic>a</italic> and created their cumulative distribution functions to conduct a statistical test. The following steps describe the process of obtaining the list of test statistics <italic>a</italic>: From the experimental results, we calculated the acceptance rate <inline-formula><mml:math id="M74"><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for all participants or target participants across all trials. We sampled the acceptance or rejection of each round from the Bernoulli distribution <inline-formula><mml:math id="M75"><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover><mml:mo>&#x02223;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> with the parameter <inline-formula><mml:math id="M76"><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> determined in the previous step, that is, <inline-formula><mml:math id="M77"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0007E;</mml:mo><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover><mml:mo>&#x02223;</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>&#x000A0;</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x02208;</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x02026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>. Parameter <italic>a</italic> was estimated using the maximum likelihood estimator for each sampling result and was added to the list of statistical quantities. This procedure was performed 1, 000 times and the sample distributions of <italic>a</italic> were obtained.</p>
<p>We computed the cumulative distribution function <inline-formula><mml:math id="M78"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:mfrac><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:munderover><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> from a list of obtained statistical values <italic>a</italic> represented as <italic>a</italic><sub>1</sub>, <italic>a</italic><sub>2</sub>, &#x02026;, <italic>a</italic><sub><italic>L</italic></sub>, where <italic>L</italic> &#x0003D; 1, 000. Similarly, we computed the cumulative distribution function <inline-formula><mml:math id="M79"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:mfrac><mml:munderover accentunder="false" accent="false"><mml:mrow><mml:mo>&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:munderover><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> from a list of statistical values <italic>b</italic>, represented by <italic>b</italic><sub>1</sub>, <italic>b</italic><sub>2</sub>, &#x02026;, <italic>b</italic><sub><italic>L</italic></sub>. Here,</p>
<disp-formula id="E12"><mml:math id="M80"><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy='false'>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo stretchy='false'>)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x02265;</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x0003C;</mml:mo><mml:mi>y</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula>
<p>where <italic>f</italic>(<italic>x, y</italic>) represents a function that returns 1 if <italic>x</italic> exceeds or is equal to <italic>y</italic>, and 0 if <italic>x</italic> is below <italic>y</italic>. Because <italic>r</italic><sub><italic>MH</italic></sub> can be used if it is significantly greater than 0, <italic>a</italic> one-sided test was performed.</p>
</sec>
<sec>
<title>3.5 Hypothesis testing 2</title>
<p>In Test 2, we tested whether the model that used the MH algorithm, that is, the acceptance decision using <inline-formula><mml:math id="M81"><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo>&#x02223;</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, was closer to the behavior of participants than that using several heuristic comparative models. We performed a test using the assessment of acceptance or rejection obtained from the results of the communication experiment, and the inferred acceptance probability was denoted as <inline-formula><mml:math id="M82"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. We created a dataset consisting of distances between the behaviors of participants and the samples generated from the probabilities calculated by the five comparison models. These models were used to evaluate the acceptance and rejection. Subsequently, <italic>U</italic>-tests were conducted for each model.</p>
<p><xref ref-type="table" rid="T3">Table 3</xref> lists the comparative models used in this study. <bold>Constant</bold> accepts with a probability <inline-formula><mml:math id="M89"><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula> calculated from the actual acceptance rate of the subject from the experimental results, which corresponds to the null hypothesis of Hypothesis testing 1. <bold>MH</bold> accepts with the inferred MH-based acceptance probability <inline-formula><mml:math id="M90"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> from the experimental results. <bold>Numerator</bold> accepts with the acceptance probability being the numerator part of the <inline-formula><mml:math id="M91"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> score, which represents the likelihood of the sign of the opponent using its own parameter. <bold>Subtraction</bold> calculates the difference between the numerator part of the <inline-formula><mml:math id="M92"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> score representing the likelihood of the sign of the opponent using the parameter of the listener and the denominator part representing the likelihood of its own sign instead of the ratio in <inline-formula><mml:math id="M93"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> score. Subsequently, it was transformed into a range of 0.0&#x02013;1.0. <bold>Binary</bold> accepts with a probability of 0.1 if the inferred acceptance probability <inline-formula><mml:math id="M94"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> is less than or equal to 0.5 and 0.9 if it exceeds 0.5.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p>Details of each model.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold>&#x00023;</bold></th>
<th valign="top" align="left"><bold>Model name</bold></th>
<th valign="top" align="left"><bold>Acceptance probability formula</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="left">Constant</td>
<td valign="top" align="left"><inline-formula><mml:math id="M83"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mo>&#x00304;</mml:mo></mml:mover></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="left">MH</td>
<td valign="top" align="left"><inline-formula><mml:math id="M84"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="left">Numerator</td>
<td valign="top" align="left"><inline-formula><mml:math id="M85"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="left">Subtraction</td>
<td valign="top" align="left"><inline-formula><mml:math id="M86"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mo>&#x022C6;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>-</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msubsup><mml:mrow><mml:mi>c</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02223;</mml:mo><mml:msup><mml:mrow><mml:mo>&#x00398;</mml:mo></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:msubsup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>/</mml:mo><mml:mn>2</mml:mn><mml:mo>&#x0002B;</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="left">Binary</td>
<td valign="top" align="left"><inline-formula><mml:math id="M87"><mml:mrow><mml:msubsup><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mn>5</mml:mn></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign='left'><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>0.1</mml:mn></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x02264;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr columnalign='left'><mml:mtd columnalign='left'><mml:mrow><mml:mn>0.9</mml:mn></mml:mrow></mml:mtd><mml:mtd columnalign='left'><mml:mrow><mml:mo stretchy='false'>(</mml:mo><mml:msubsup><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0003E;</mml:mo><mml:mn>0.5</mml:mn><mml:mo stretchy='false'>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula></td>
</tr></tbody>
</table>
</table-wrap>
<p>To test the statistical significance of models <italic>m</italic> and <italic>m</italic>&#x02032; that make decisions regarding acceptance and rejection, hypothesis tests were performed as null and alternative hypotheses, respectively, as follows:</p>
<list list-type="bullet">
<list-item><p><italic>H</italic><sub>0</sub>: <inline-formula><mml:math id="M95"><mml:msub><mml:mrow><mml:mtext>Prec</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mtext>Prec</mml:mtext></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math></inline-formula>. The models <italic>m</italic> and <italic>m</italic>&#x02032; predict the behavior of participants at the same level.</p></list-item>
<list-item><p><italic>H</italic><sub>1</sub>: <inline-formula><mml:math id="M96"><mml:msub><mml:mrow><mml:mtext>Prec</mml:mtext></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>&#x0003E;</mml:mo><mml:msub><mml:mrow><mml:mtext>Prec</mml:mtext></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi>&#x02032;</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math></inline-formula>. The model <italic>m</italic> predicts the behavior of participants more accurately than the model <italic>m</italic>&#x02032;.</p></list-item>
</list>
<p>Here, Prec<sub><italic>m</italic></sub> is the rate at which the model <italic>m</italic> could predict the acceptance or rejection decisions of participants, that is, precision.</p>
<p>We sampled 100 data points for the pseudo-experimental results of each comparison model using computer simulations. The pseudo-experimental results for each comparison model were sampled from the Bernoulli distribution with the parameter of acceptance probability <inline-formula><mml:math id="M97"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> for subject <italic>j</italic> of model <italic>m</italic> in the <italic>i</italic>th communication trial and labeled 1 for acceptance and 0 for rejection. The <italic>p</italic> values were calculated using a <italic>U</italic>-test, and the significance level was set at 0.001.</p>
<disp-formula id="E13"><mml:math id="M98"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup><mml:mo>&#x0007E;</mml:mo><mml:mtext>Bern</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x02223;</mml:mo><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<p>Precision was calculated as follows: First, we store the acceptance/rejection evaluation of the <italic>j</italic>-th participant at the <italic>i</italic>th trial in the experiment in <inline-formula><mml:math id="M99"><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>h</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, where <italic>j</italic> &#x0003D; 1, &#x022EF;, 20. Second, we store the acceptance/rejection evaluation results of model <italic>m</italic> in the <italic>i</italic>-th trial of the pseudo-experiment for subject <italic>j</italic> in <inline-formula><mml:math id="M100"><mml:msubsup><mml:mrow><mml:mi>z</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>, where <italic>i</italic> &#x0003D; 1, &#x022EF;, 45 (<italic>i</italic> &#x0003D; 1, &#x022EF;, 90 for both datasets). Third, we calculate the precision of model <italic>m</italic> in predicting the behavior of the <italic>j</italic>-th participant.</p>
<p>Precision Prec<sub><italic>m</italic></sub> is calculated by counting the number of matches between the decisions of the participants and the model. One-sided tests were conducted for all model combinations.</p>
</sec>
</sec>
<sec id="s4">
<title>4 Results and discussion</title>
<sec>
<title>4.1 Hypothesis testing 1</title>
<p><xref ref-type="fig" rid="F7">Figure 7</xref> illustrates an example of the actual acceptance/rejection behavior of a participant and the inferred acceptance probabilities <italic>r</italic><sup><italic>MH</italic></sup>. This suggests some coherence between <inline-formula><mml:math id="M101"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> and the behavior of participants. This association was evaluated quantitatively and statistically.</p>
<fig id="F7" position="float">
<label>Figure 7</label>
<caption><p>Example of the actual acceptance made by a participant and the inferred acceptance probabilities <inline-formula><mml:math id="M88"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula>. Dataset 1 <bold>(left)</bold>, Dataset 2 <bold>(right)</bold>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0007.tif"/>
</fig>
<p><xref ref-type="fig" rid="F8">Figure 8</xref> shows a histogram of the number of accepted stimuli for each acceptance rate (left) and the actual acceptance rate for each acceptance rate with a graph of <italic>y</italic> &#x0003D; <italic>ar</italic>&#x0002B;<italic>b</italic> using the estimated weights <italic>a</italic> and bias <italic>b</italic> (right) for all the participants, where <italic>a</italic> &#x0003D; 0.5105 and <italic>b</italic> &#x0003D; 0.4842. When the inferred acceptance rate was high, the actual acceptance rate by humans was also high. However, the actual probability of acceptance was higher than <italic>r</italic><sup><italic>MH</italic></sup> when <italic>r</italic><sup><italic>MH</italic></sup> was low. It was rare for the inferred acceptance rate, <inline-formula><mml:math id="M102"><mml:msubsup><mml:mrow><mml:mi>r</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mi>H</mml:mi></mml:mrow></mml:msubsup></mml:math></inline-formula> to assume intermediate values between 0.2 and 0.8. This bias is inherent in the nature of the MHNG and does not reflect the characteristics of human participants. In the MH algorithm, acceptance probability is determined by the ratio of one probability to another, which often results in values close to 0 or 1. For further clarification, <xref ref-type="fig" rid="F9">Figure 9</xref> shows the acceptance rate as observed in computer simulations for comparison.</p>
<fig id="F8" position="float">
<label>Figure 8</label>
<caption><p>Relationship between the acceptance status of all participants and the inferred value of the acceptance probability Graphs of the number of accepted names for each inferred acceptance probability for all participants <bold>(left)</bold>, the actual acceptance rate for each inferred acceptance probability for all participants, and the graph of <italic>y</italic> &#x0003D; <italic>ar</italic> &#x0002B; <italic>b</italic> with weights &#x0201C;<italic>a</italic>&#x0201D; and bias &#x0201C;<italic>b</italic>&#x0201D; estimated by linear regression <bold>(right)</bold>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0008.tif"/>
</fig>
<fig id="F9" position="float">
<label>Figure 9</label>
<caption><p>Relationship between the acceptance status of the computer and the value of the acceptance probability Graphs of the number of accepted names for each acceptance probability for the computer <bold>(left)</bold>, the actual acceptance rate for each acceptance probability in the simulation <bold>(right)</bold>.</p></caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="frai-06-1235231-g0009.tif"/>
</fig>
<p>Here, we discuss the results of the hypotheses tests. First, we examine the results of Test 1. The estimated parameters for Datasets 1 and 2 are shown in <xref ref-type="table" rid="T4">Table 4</xref>. The hypothesis tests for each and both datasets for all subjects were rejected at a significance level of 0.001. Therefore, the null hypothesis was rejected, indicating that the model using acceptance probability computed by the MH algorithm is a significantly better predictor of human behavior than the model using a constant probability of acceptance.</p>
<table-wrap position="float" id="T4">
<label>Table 4</label>
<caption><p>Parameters <italic>a,b</italic> estimated and <italic>p</italic>-values on the data of each subject and the data aggregated over all participants for each dataset.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th/>
<th valign="top" align="center" colspan="3"><bold>Dataset 1 (hard)</bold></th>
<th valign="top" align="center" colspan="3"><bold>Dataset 2 (easy)</bold></th>
</tr>
</thead>
<tbody>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<td/>
<td valign="top" align="center"><italic>a</italic></td>
<td valign="top" align="center"><italic>b</italic></td>
<td valign="top" align="center"><italic>P</italic><sub><italic>a</italic></sub>(<italic>a</italic>)</td>
<td valign="top" align="center"><italic>a</italic></td>
<td valign="top" align="center"><italic>b</italic></td>
<td valign="top" align="center"><italic>P</italic><sub><italic>a</italic></sub>(<italic>a</italic>)</td>
</tr>
<tr>
<td valign="top" align="left">1</td>
<td valign="top" align="center">0.6195</td>
<td valign="top" align="center">0.3749</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">0.6698</td>
<td valign="top" align="center">0.0000</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">2</td>
<td valign="top" align="center">0.2167</td>
<td valign="top" align="center">0.7832</td>
<td valign="top" align="center">0.011</td>
<td valign="top" align="center">0.2348</td>
<td valign="top" align="center">0.7938</td>
<td valign="top" align="center">0.002</td>
</tr>
<tr>
<td valign="top" align="left">3</td>
<td valign="top" align="center">0.4305</td>
<td valign="top" align="center">0.6085</td>
<td valign="top" align="center">0.022</td>
<td valign="top" align="center">0.3260</td>
<td valign="top" align="center">0.7223</td>
<td valign="top" align="center">0.066</td>
</tr>
<tr>
<td valign="top" align="left">4</td>
<td valign="top" align="center">0.3903</td>
<td valign="top" align="center">0.6557</td>
<td valign="top" align="center">0.009</td>
<td valign="top" align="center">0.7046</td>
<td valign="top" align="center">0.2499</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">5</td>
<td valign="top" align="center">0.2253</td>
<td valign="top" align="center">0.7771</td>
<td valign="top" align="center">0.011</td>
<td valign="top" align="center">&#x02212;0.0002</td>
<td valign="top" align="center">1.0000</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">6</td>
<td valign="top" align="center">0.1227</td>
<td valign="top" align="center">0.8783</td>
<td valign="top" align="center">0.034</td>
<td valign="top" align="center">&#x02212;0.0004</td>
<td valign="top" align="center">1.0002</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">7</td>
<td valign="top" align="center">0.5659</td>
<td valign="top" align="center">0.4285</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.7047</td>
<td valign="top" align="center">0.2496</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">8</td>
<td valign="top" align="center">0.4181</td>
<td valign="top" align="center">0.5552</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.0600</td>
<td valign="top" align="center">1.0007</td>
<td valign="top" align="center">0.432</td>
</tr>
<tr>
<td valign="top" align="left">9</td>
<td valign="top" align="center">0.4320</td>
<td valign="top" align="center">0.5779</td>
<td valign="top" align="center">0.002</td>
<td valign="top" align="center">0.3277</td>
<td valign="top" align="center">1.0001</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">10</td>
<td valign="top" align="center">&#x02212;0.0001</td>
<td valign="top" align="center">1.0002</td>
<td valign="top" align="center">1.0</td>
<td valign="top" align="center">0.5000</td>
<td valign="top" align="center">0.5000</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">11</td>
<td valign="top" align="center">0.2608</td>
<td valign="top" align="center">0.7446</td>
<td valign="top" align="center">0.016</td>
<td valign="top" align="center">0.4816</td>
<td valign="top" align="center">0.4927</td>
<td valign="top" align="center">0.006</td>
</tr>
<tr>
<td valign="top" align="left">12</td>
<td valign="top" align="center">0.3551</td>
<td valign="top" align="center">0.6572</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x02212;0.0005</td>
<td valign="top" align="center">1.0071</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">13</td>
<td valign="top" align="center">0.7148</td>
<td valign="top" align="center">0.2846</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">0.4333</td>
<td valign="top" align="center">0.5766</td>
<td valign="top" align="center">0.002</td>
</tr>
<tr>
<td valign="top" align="left">14</td>
<td valign="top" align="center">0.2319</td>
<td valign="top" align="center">0.7682</td>
<td valign="top" align="center">0.012</td>
<td valign="top" align="center">&#x02212;0.0005</td>
<td valign="top" align="center">1.0004</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">15</td>
<td valign="top" align="center">0.5850</td>
<td valign="top" align="center">0.3999</td>
<td valign="top" align="center">0.001</td>
<td valign="top" align="center">0.9187</td>
<td valign="top" align="center">0.0000</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">16</td>
<td valign="top" align="center">0.3537</td>
<td valign="top" align="center">0.6585</td>
<td valign="top" align="center">0.002</td>
<td valign="top" align="center">&#x02212;0.0002</td>
<td valign="top" align="center">1.0001</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">17</td>
<td valign="top" align="center">0.8088</td>
<td valign="top" align="center">0.1383</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">0.5000</td>
<td valign="top" align="center">0.5000</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">18</td>
<td valign="top" align="center">&#x02212;0.0003</td>
<td valign="top" align="center">1.0001</td>
<td valign="top" align="center">1.0</td>
<td valign="top" align="center">0.5000</td>
<td valign="top" align="center">0.5000</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">19</td>
<td valign="top" align="center">0.8642</td>
<td valign="top" align="center">0.1356</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">0.8971</td>
<td valign="top" align="center">0.0757</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">20</td>
<td valign="top" align="center">0.4477</td>
<td valign="top" align="center">0.2798</td>
<td valign="top" align="center">0.003</td>
<td valign="top" align="center">0.7933</td>
<td valign="top" align="center">0.0974</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">All</td>
<td valign="top" align="center">0.4910</td>
<td valign="top" align="center">0.5030</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">0.5478</td>
<td valign="top" align="center">0.4476</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<td/>
<td valign="top" align="center" colspan="6"><bold>ALL dataset</bold></td>
</tr>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<td/>
<td valign="top" align="center" colspan="2"><italic>a</italic></td>
<td valign="top" align="center" colspan="2"><italic>b</italic></td>
<td valign="top" align="center" colspan="2"><italic>P</italic><sub><italic>a</italic></sub>(<italic>a</italic>)</td>
</tr>
<tr>
<td valign="top" align="left">All</td>
<td valign="top" align="center" colspan="2">0.5105</td>
<td valign="top" align="center" colspan="2">0.4842</td>
<td valign="top" align="center" colspan="2">&#x0003C; 0.001</td>
</tr></tbody>
</table>
</table-wrap>
<p>For more detail, we examined each participant&#x00027;s behavior. The <italic>p</italic>-values <italic>P</italic><sub><italic>a</italic></sub>(<italic>a</italic>) for each subject, as presented in <xref ref-type="table" rid="T4">Table 4</xref>, indicate that the null hypothesis was rejected at the 0.05 significance level for most subjects. Specifically, exceptions were found for two participants, namely 10 and 18, in dataset 1. In dataset 2, all results were rejected at the 0.05 significance level except for the results for participants 5, 6, 9, 12, 14, and 16. Overall, the null hypothesis was rejected in most cases.</p>
</sec>
<sec>
<title>4.2 Hypothesis testing 2</title>
<p>Here, we examine the results of Test 2. <xref ref-type="table" rid="T5">Table 5</xref> shows the <italic>p</italic>-values obtained from the <italic>U</italic>-tests conducted for each combination of models. The row for <bold>MH</bold> (i.e., <italic>m</italic> &#x0003D; 2) in <xref ref-type="table" rid="T5">Table 5</xref> shows that the null hypothesis was rejected for all the models. The model using the MH algorithm was the closest to the behaviors of participants among the models compared in this study. We also individually performed tests on data from each participant. <xref ref-type="table" rid="T6">Table 6</xref> presents the results. For each participant, <bold>MH</bold> outperformed the other models in predicting behavior in all cases, except for six participants in <bold>Constant</bold> and one in <bold>Subtraction</bold>. For the six participants, <bold>MH</bold> did not significantly outperform <bold>Constant</bold>, and for one participant, <bold>MH</bold> did not significantly outperform <bold>Subtraction</bold>. We tested the data for each participant separately and for each dataset. <xref ref-type="table" rid="T7">Tables 7</xref>, <xref ref-type="table" rid="T8">8</xref> list the results. Looking at the <bold>MH</bold> (i.e., <italic>m</italic> &#x0003D; 2) row in <xref ref-type="table" rid="T7">Table 7</xref>, <bold>MH</bold> outperformed the other models in all cases except seven for <bold>Constant</bold> and one for <bold>Numerator</bold>. Looking at the <bold>MH</bold> (i.e., <italic>m</italic> &#x0003D; 2) row in <xref ref-type="table" rid="T8">Table 8</xref>, <bold>MH</bold> outperformed the other models in all cases, except five for <bold>Constant</bold>. Based on these results, we argue that the acceptance probability derived from the MH algorithm is, to some extent, consistent with the acceptance/rejection judgment probabilities exhibited by humans.</p>
<table-wrap position="float" id="T5">
<label>Table 5</label>
<caption><p><italic>p</italic>-value for <italic>U</italic>-test for each model combination for all participants.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold><italic>m</italic>\<italic>m</italic><sup>&#x02032;</sup></bold></th>
<th valign="top" align="center"><bold>Constant</bold></th>
<th valign="top" align="center"><bold>MH</bold></th>
<th valign="top" align="center"><bold>Numerator</bold></th>
<th valign="top" align="center"><bold>Subtraction</bold></th>
<th valign="top" align="center"><bold>Binary</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Constant</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">MH</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
</tr>
<tr>
<td valign="top" align="left">Numerator</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">0.003</td>
</tr>
<tr>
<td valign="top" align="left">Subtraction</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">1.000</td>
</tr>
<tr>
<td valign="top" align="left">Binary</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">1.000</td>
<td valign="top" align="center">0.997</td>
<td valign="top" align="center">&#x0003C; 0.001</td>
<td valign="top" align="center">&#x02014;</td>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T6">
<label>Table 6</label>
<caption><p>Number of participants whose behavior resulted in the rejection of the null hypothesis for each pair of models.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold><italic>m</italic>\<italic>m</italic><sup>&#x02032;</sup></bold></th>
<th valign="top" align="center"><bold>Constant</bold></th>
<th valign="top" align="center"><bold>MH</bold></th>
<th valign="top" align="center"><bold>Numerator</bold></th>
<th valign="top" align="center"><bold>Subtraction</bold></th>
<th valign="top" align="center"><bold>Binary</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Constant</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">12</td>
<td valign="top" align="center">18</td>
<td valign="top" align="center">12</td>
</tr>
<tr>
<td valign="top" align="left">MH</td>
<td valign="top" align="center">14</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">19</td>
<td valign="top" align="center">20</td>
</tr>
<tr>
<td valign="top" align="left">Numerator</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">7</td>
</tr>
<tr>
<td valign="top" align="left">Subtraction</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" align="left">Binary</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">&#x02014;</td>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T7">
<label>Table 7</label>
<caption><p>Number of participants whose behavior resulted in the rejection of the null hypothesis for each pair of models in Dataset 1.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold><italic>m</italic>\<italic>m</italic><sup>&#x02032;</sup></bold></th>
<th valign="top" align="center"><bold>Constant</bold></th>
<th valign="top" align="center"><bold>MH</bold></th>
<th valign="top" align="center"><bold>Numerator</bold></th>
<th valign="top" align="center"><bold>Subtraction</bold></th>
<th valign="top" align="center"><bold>Binary</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Constant</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">12</td>
<td valign="top" align="center">18</td>
<td valign="top" align="center">12</td>
</tr>
<tr>
<td valign="top" align="left">MH</td>
<td valign="top" align="center">13</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">19</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">20</td>
</tr>
<tr>
<td valign="top" align="left">Numerator</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">8</td>
</tr>
<tr>
<td valign="top" align="left">Subtraction</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" align="left">Binary</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">&#x02014;</td>
</tr></tbody>
</table>
</table-wrap>
<table-wrap position="float" id="T8">
<label>Table 8</label>
<caption><p>Number of participants whose behavior resulted in the rejection of the null hypothesis for each pair of models in Dataset 2.</p></caption>
<table frame="box" rules="all">
<thead>
<tr style="background-color:&#x00023;919498;color:&#x00023;ffffff">
<th valign="top" align="left"><bold><italic>m</italic>\<italic>m</italic><sup>&#x02032;</sup></bold></th>
<th valign="top" align="center"><bold>Constant</bold></th>
<th valign="top" align="center"><bold>MH</bold></th>
<th valign="top" align="center"><bold>Numerator</bold></th>
<th valign="top" align="center"><bold>Subtraction</bold></th>
<th valign="top" align="center"><bold>Binary</bold></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Constant</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">10</td>
<td valign="top" align="center">18</td>
<td valign="top" align="center">9</td>
</tr>
<tr>
<td valign="top" align="left">MH</td>
<td valign="top" align="center">15</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">20</td>
</tr>
<tr>
<td valign="top" align="left">Numerator</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">9</td>
</tr>
<tr>
<td valign="top" align="left">Subtraction</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">&#x02014;</td>
<td valign="top" align="center">0</td>
</tr>
<tr>
<td valign="top" align="left">Binary</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">20</td>
<td valign="top" align="center">&#x02014;</td>
</tr></tbody>
</table>
</table-wrap>
<p>The experimental results suggested that human behavior in the JA-NG follows the MH algorithm. Consequently, this result suggests that symbol emergence in the JA-NG among people may be attained by performing decentralized Bayesian inference, i.e., collective predictive coding (Taniguchi, <xref ref-type="bibr" rid="B34">2023</xref>).</p>
</sec>
</sec>
<sec sec-type="conclusions" id="s5">
<title>5 Conclusion</title>
<p>In this study, we conducted a communication experiment on symbol emergence, in which participants played the JA-NG in pairs. We compared the acceptance decisions of human participants with those of the computational models and confirmed that the acceptance probability of the model based on the MH algorithm predicted human behavior significantly better than the constant probability acceptance model. Additionally, the MH-based model outperformed the other four comparative computational models in terms of predicting the behavior of participants through two statistical tests. Consequently, the model using the MH algorithm was found to be suitable for explaining human acceptance behavior in the JA-NG.</p>
<p>This suggests that the MHNG, which was studied computationally as a constructive approach to human symbol emergence, is a reasonable model for explaining symbol emergence in computational agents and human groups. This finding also supports the collective predictive coding hypothesis, which argues that symbol emergence in human society can be regarded as a decentralized Bayesian inference of a prior variable shared among people (Taniguchi, <xref ref-type="bibr" rid="B34">2023</xref>; Taniguchi et al., <xref ref-type="bibr" rid="B38">2023</xref>). To advance our understanding of the human acceptance evaluation in the JA-NG and the dynamics of symbol emergence among people, future studies should gather more evidence by conducting experiments in diverse scenarios to test whether they follow the MH algorithm.</p>
<p>The limitations of the current experiment, as well as potential future extensions, are outlined below.</p>
<p>In the experiment presented in this paper, the number of participants in the JA-NG was limited to two. Theoretically, the MHNG model is capable of accommodating multiple agents. Inukai et al. (<xref ref-type="bibr" rid="B17">2023</xref>) proposed the Recursive MHNG, demonstrating its potential to handle <italic>N</italic>-agent scenarios. Additionally, in our experiment, the same object, i.e., a color image, was shown simultaneously to both participants. Yet, the original computational model facilitated symbol emergence among two agents observing a single object from distinct perspectives (Inukai et al., <xref ref-type="bibr" rid="B17">2023</xref>; Taniguchi et al., <xref ref-type="bibr" rid="B38">2023</xref>). Given the multi-agent setting and diverse perspectives in a real environment, incorporating these factors into an experimental semiotic study based on the JA-NG is a promising avenue for extension.</p>
<p>From the viewpoint of MHNG theory, there are still several limitations. Although emergent communication research currently places significant emphasis on the emergence of compositional linguistic structures with syntax (Lazaridou and Baroni, <xref ref-type="bibr" rid="B21">2020</xref>), the MHNG only rigorously addresses the emergence of categorical symbols in a mathematical sense. An extension is needed to capture more complex linguistic structures. Also, as mentioned in Section 3.4, the current theory does not account for social and other cognitive aspects. Incorporating these considerations is another direction we plan to explore. In addition, the JA-NG assumes joint attention. While joint attention is not restricted to an external object, extending the theory to non-external objects, such as emotions, is another avenue for future exploration (Taniguchi, <xref ref-type="bibr" rid="B33">2021</xref>).</p>
<p>Exploring symbol emergence in a human-agent mixed system is a future challenge worth pursuing. Because we obtained evidence supporting the prediction of the behavior of human participants using the MH algorithm, we could approximate human behavior as a computational agent following the MH algorithm. Based on this approximation, we can theoretically model and analyze a mixed system involving a human participant and a computer agent.</p>
</sec>
<sec sec-type="data-availability" id="s6">
<title>Data availability statement</title>
<p>The datasets presented in this study can be found in online repositories. The names of the repository/repositories and accession number(s) can be found at: <ext-link ext-link-type="uri" xlink:href="https://github.com/OkumuraRyotaDesu/Subject-Experimental-result-Data">https://github.com/OkumuraRyotaDesu/Subject-Experimental-result-Data</ext-link>.</p>
</sec>
<sec sec-type="ethics-statement" id="s7">
<title>Ethics statement</title>
<p>The studies involving humans were approved by the Research Ethics Committee of Ritsumeikan University. The studies were conducted in accordance with the local legislation and institutional requirements. The participants provided their written informed consent to participate in this study.</p>
</sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>RO designed the study, collected data, conducted the experiment, and wrote the manuscript. TT contributed to the key idea of this study, performed data analysis and interpretation, and contributed to the writing of the manuscript. AT and YH critically reviewed the manuscript and assisted in its preparation. All authors approved the final version of the manuscript and agreed to be accountable for all aspects of the work, ensuring that any questions related to the accuracy or integrity of any part of the work are appropriately investigated and resolved.</p>
</sec>
</body>
<back>
<sec sec-type="funding-information" id="s9">
<title>Funding</title>
<p>This work was supported by JSPS KAKENHI Grant Numbers JP23H04835, JP21H04904, and JP17H06379.</p>
</sec>
<ack><p>The authors thank Prof. Takeuchi of Nagoya University for advice on hypothesis testing methods.</p>
</ack>
<sec sec-type="COI-statement" id="conf1">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x00027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<fn-group>
<fn id="fn0001"><p><sup>1</sup>Pillow (PIL Fork) 8.4.0: <ext-link ext-link-type="uri" xlink:href="https://pillow.readthedocs.io/en/stable/">https://pillow.readthedocs.io/en/stable/</ext-link>.</p></fn>
<fn id="fn0002"><p><sup>2</sup>This is because it is difficult to analytically determine the distribution that the estimated statistics <italic>a</italic> follow. We could not perform conventional tests such as the <italic>t</italic>-test.</p></fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Bishop</surname> <given-names>C. M.</given-names></name> <name><surname>Nasrabadi</surname> <given-names>N. M.</given-names></name></person-group> (<year>2006</year>). <source>Pattern Recognition and Machine Learning</source>, Vol. <volume>4</volume>. <publisher-loc>New York. NY</publisher-loc>: <publisher-name>Springer</publisher-name>.</citation>
</ref>
<ref id="B2">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bouchacourt</surname> <given-names>D.</given-names></name> <name><surname>Baroni</surname> <given-names>M.</given-names></name></person-group> (<year>2019</year>). <article-title>Miss tools and MR fruit: emergent communication in agents learning about object affordances</article-title>. <source>arXiv</source> [preprint]. <pub-id pub-id-type="doi">10.48550/arXiv.1905.11871</pub-id></citation>
</ref>
<ref id="B3">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cangelosi</surname> <given-names>A.</given-names></name> <name><surname>Parisi</surname> <given-names>D.</given-names></name></person-group> (<year>1998</year>). <article-title>The emergence of a&#x00027;language&#x00027;in an evolving population of neural networks</article-title>. <source>Conn. Sci</source>. <volume>10</volume>, <fpage>83</fpage>&#x02013;<lpage>97</lpage>. <pub-id pub-id-type="doi">10.1080/095400998116512</pub-id></citation>
</ref>
<ref id="B4">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Choi</surname> <given-names>E.</given-names></name> <name><surname>Lazaridou</surname> <given-names>A.</given-names></name> <name><surname>de Freitas</surname> <given-names>N.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Compositional obverter communication learning from raw visual input,&#x0201D;</article-title> in <source>The International Conference on Learning Representation</source> (<publisher-loc>Vancouver, BC</publisher-loc>). Available online at: <ext-link ext-link-type="uri" xlink:href="https://iclr.cc/archive/www/doku.php%3Fid=iclr2018:main.html">https://iclr.cc/archive/www/doku.php%3Fid=iclr2018:main.html</ext-link></citation>
</ref>
<ref id="B5">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cornish</surname> <given-names>H.</given-names></name></person-group> (<year>2010</year>). <article-title>Investigating how cultural transmission leads to the appearance of design without a designer in human communication systems</article-title>. <source>Interact. Stud</source>. <volume>11</volume>, <fpage>112</fpage>&#x02013;<lpage>137</lpage>. <pub-id pub-id-type="doi">10.1075/is.11.1.02cor</pub-id></citation>
</ref>
<ref id="B6">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Evtimova</surname> <given-names>K.</given-names></name> <name><surname>Drozdov</surname> <given-names>A.</given-names></name> <name><surname>Kiela</surname> <given-names>D.</given-names></name> <name><surname>Cho</surname> <given-names>K.</given-names></name></person-group> (<year>2018</year>). <article-title>&#x0201C;Emergent communication in a multi-modal, multi-step referential game,&#x0201D;</article-title> in <source>Conference on Learning Representations (ICLR)</source> (<publisher-loc>Vancouver, BC</publisher-loc>: <publisher-name>Vancouver Convention Center</publisher-name>). Available online at: <ext-link ext-link-type="uri" xlink:href="https://iclr.cc/archive/www/doku.php%3Fid=iclr2018:main.html">https://iclr.cc/archive/www/doku.php%3Fid=iclr2018:main.html</ext-link></citation>
</ref>
<ref id="B7">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Friston</surname> <given-names>K.</given-names></name></person-group> (<year>2010</year>). <article-title>The free-energy principle: a unified brain theory?</article-title> <source>Nat. Rev. Neurosci</source>. <volume>11</volume>, <fpage>127</fpage>&#x02013;<lpage>138</lpage>. <pub-id pub-id-type="doi">10.1038/nrn2787</pub-id><pub-id pub-id-type="pmid">20068583</pub-id></citation></ref>
<ref id="B8">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Friston</surname> <given-names>K.</given-names></name> <name><surname>Moran</surname> <given-names>R. J.</given-names></name> <name><surname>Nagai</surname> <given-names>Y.</given-names></name> <name><surname>Taniguchi</surname> <given-names>T.</given-names></name> <name><surname>Gomi</surname> <given-names>H.</given-names></name> <name><surname>Tenenbaum</surname> <given-names>J.</given-names></name> <etal/></person-group>. (<year>2021</year>). <article-title>World model learning and inference</article-title>. <source>Neural Netw</source>. <volume>144</volume>, <fpage>573</fpage>&#x02013;<lpage>590</lpage>. <pub-id pub-id-type="doi">10.1016/j.neunet.2021.09.011</pub-id></citation>
</ref>
<ref id="B9">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Galantucci</surname> <given-names>B.</given-names></name></person-group> (<year>2005</year>). <article-title>An experimental study of the emergence of human communication systems</article-title>. <source>Cogn. Sci</source>. <volume>29</volume>, <fpage>737</fpage>&#x02013;<lpage>767</lpage>. <pub-id pub-id-type="doi">10.1207/s15516709cog0000_34</pub-id><pub-id pub-id-type="pmid">21702792</pub-id></citation></ref>
<ref id="B10">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gluyas</surname> <given-names>H.</given-names></name></person-group> (<year>2015</year>). <article-title>Effective communication and teamwork promotes patient safety</article-title>. <source>Nurs. Standard</source> <volume>29</volume>, <fpage>50</fpage>. <pub-id pub-id-type="doi">10.7748/ns.29.49.50.e10042</pub-id><pub-id pub-id-type="pmid">26243123</pub-id></citation></ref>
<ref id="B11">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hagiwara</surname> <given-names>Y.</given-names></name> <name><surname>Furukawa</surname> <given-names>K.</given-names></name> <name><surname>Taniguchi</surname> <given-names>A.</given-names></name> <name><surname>Taniguchi</surname> <given-names>T.</given-names></name></person-group> (<year>2022</year>). <article-title>Multiagent multimodal categorization for symbol emergence: emergent communication via interpersonal cross-modal inference</article-title>. <source>Adv. Robot</source>. <volume>36</volume>, <fpage>239</fpage>&#x02013;<lpage>260</lpage>. <pub-id pub-id-type="doi">10.1080/01691864.2022.2029721</pub-id></citation>
</ref>
<ref id="B12">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hagiwara</surname> <given-names>Y.</given-names></name> <name><surname>Kobayashi</surname> <given-names>H.</given-names></name> <name><surname>Taniguchi</surname> <given-names>A.</given-names></name> <name><surname>Taniguchi</surname> <given-names>T.</given-names></name></person-group> (<year>2019</year>). <article-title>Symbol emergence as an interpersonal multimodal categorization</article-title>. <source>Front. Robot. AI</source> <volume>6</volume>, <fpage>134</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2019.00134</pub-id><pub-id pub-id-type="pmid">33501149</pub-id></citation></ref>
<ref id="B13">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hastings</surname> <given-names>W. K.</given-names></name></person-group> (<year>1970</year>). <article-title>Monte Carlo sampling methods using Markov chains and their applications</article-title>. <source>Biometrika</source> <volume>57</volume>, <fpage>97</fpage>&#x02013;<lpage>109</lpage>. <pub-id pub-id-type="doi">10.1093/biomet/57.1.97</pub-id></citation>
</ref>
<ref id="B14">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Havrylov</surname> <given-names>S.</given-names></name> <name><surname>Titov</surname> <given-names>I.</given-names></name></person-group> (<year>2017</year>). <article-title>Emergence of language with multi-agent games: learning to communicate with sequences of symbols</article-title>. <source>Adv. Neural Inf. Process. Syst</source>. 30. Available online at: <ext-link ext-link-type="uri" xlink:href="https://openreview.net/forum?id=SkaxnKEYg">https://openreview.net/forum?id=SkaxnKEYg</ext-link></citation>
</ref>
<ref id="B15">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Healey</surname> <given-names>P. G.</given-names></name> <name><surname>Swoboda</surname> <given-names>N.</given-names></name> <name><surname>Umata</surname> <given-names>I.</given-names></name> <name><surname>King</surname> <given-names>J.</given-names></name></person-group> (<year>2007</year>). <article-title>Graphical language games: Interactional constraints on representational form</article-title>. <source>Cogn. Sci</source>. <volume>31</volume>, <fpage>285</fpage>&#x02013;<lpage>309</lpage>. <pub-id pub-id-type="doi">10.1080/15326900701221363</pub-id><pub-id pub-id-type="pmid">21635298</pub-id></citation></ref>
<ref id="B16">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Hohwy</surname> <given-names>J.</given-names></name></person-group> (<year>2013</year>). <source>The Predictive Mind</source>. <publisher-loc>Oxford</publisher-loc>: <publisher-name>Oxford University Press</publisher-name>. <pub-id pub-id-type="doi">10.1093/acprof:oso/9780199682737.001.0001</pub-id></citation>
</ref>
<ref id="B17">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Inukai</surname> <given-names>J.</given-names></name> <name><surname>Taniguchi</surname> <given-names>T.</given-names></name> <name><surname>Taniguchi</surname> <given-names>A.</given-names></name> <name><surname>Hagiwara</surname> <given-names>Y.</given-names></name></person-group> (<year>2023</year>). <article-title>Recursive metropolis-hastings naming game: symbol emergence in a multi-agent system based on probabilistic generative models</article-title>. <source>Front. Artif. Intell</source>. 6, 1229127. <pub-id pub-id-type="doi">10.3389/frai.2023.1229127</pub-id><pub-id pub-id-type="pmid">37920571</pub-id></citation></ref>
<ref id="B18">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kirby</surname> <given-names>S.</given-names></name></person-group> (<year>2002</year>). <article-title>Natural language from artificial life</article-title>. <source>Artif. Life</source> <volume>8</volume>, <fpage>185</fpage>&#x02013;<lpage>215</lpage>. <pub-id pub-id-type="doi">10.1162/106454602320184248</pub-id></citation>
</ref>
<ref id="B19">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kirby</surname> <given-names>S.</given-names></name> <name><surname>Cornish</surname> <given-names>H.</given-names></name> <name><surname>Smith</surname> <given-names>K.</given-names></name></person-group> (<year>2008</year>). <article-title>Cumulative cultural evolution in the laboratory: an experimental approach to the origins of structure in human language</article-title>. <source>Proc. Natl. Acad. Sci</source>. <volume>105</volume>, <fpage>10681</fpage>&#x02013;<lpage>10686</lpage>. <pub-id pub-id-type="doi">10.1073/pnas.0707835105</pub-id><pub-id pub-id-type="pmid">18667697</pub-id></citation></ref>
<ref id="B20">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Kottur</surname> <given-names>S.</given-names></name> <name><surname>Moura</surname> <given-names>J. M.</given-names></name> <name><surname>Lee</surname> <given-names>S.</given-names></name> <name><surname>Batra</surname> <given-names>D.</given-names></name></person-group> (<year>2017</year>). <article-title>Natural language does not emerge &#x02018;naturally&#x00027; in multi-agent dialog</article-title>. <source>arXiv</source> [preprint]. <pub-id pub-id-type="doi">10.48550/arXiv.1706.08502</pub-id></citation>
</ref>
<ref id="B21">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lazaridou</surname> <given-names>A.</given-names></name> <name><surname>Baroni</surname> <given-names>M.</given-names></name></person-group> (<year>2020</year>). <article-title>Emergent multi-agent communication in the deep learning era</article-title>. <source>arXiv</source> [preprint]. <pub-id pub-id-type="doi">10.48550/arXiv.2006.02419</pub-id></citation>
</ref>
<ref id="B22">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Lazaridou</surname> <given-names>A.</given-names></name> <name><surname>Peysakhovich</surname> <given-names>A.</given-names></name> <name><surname>Baroni</surname> <given-names>M.</given-names></name></person-group> (<year>2017</year>). <article-title>&#x0201C;Multi-agent cooperation and the emergence of (natural) language,&#x0201D;</article-title> in <source>International Conference on Learning Representations (ICLR)</source>. Toulon. Available online at: <ext-link ext-link-type="uri" xlink:href="https://iclr.cc/archive/www/2017.html">https://iclr.cc/archive/www/2017.html</ext-link></citation>
</ref>
<ref id="B23">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Lewis</surname> <given-names>D.</given-names></name></person-group> (<year>2008</year>). <source>Convention: A Philosophical Study</source>. <publisher-loc>Hoboken, NJ</publisher-loc>: <publisher-name>John Wiley and Sons</publisher-name>.</citation>
</ref>
<ref id="B24">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Mu</surname> <given-names>J.</given-names></name> <name><surname>Goodman</surname> <given-names>N.</given-names></name></person-group> (<year>2021</year>). <article-title>Emergent communication of generalizations</article-title>. <source>Adv. Neural Inf. Process. Syst</source>. <volume>34</volume>, <fpage>17994</fpage>&#x02013;<lpage>18007</lpage>. Available online at: <ext-link ext-link-type="uri" xlink:href="https://proceedings.neurips.cc/paper_files/paper/2021/file/9597353e41e6957b5e7aa79214fcb256-Paper.pdf">https://proceedings.neurips.cc/paper_files/paper/2021/file/9597353e41e6957b5e7aa79214fcb256-Paper.pdf</ext-link></citation>
</ref>
<ref id="B25">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Navarro</surname> <given-names>D. J.</given-names></name> <name><surname>Perfors</surname> <given-names>A.</given-names></name> <name><surname>Kary</surname> <given-names>A.</given-names></name> <name><surname>Brown</surname> <given-names>S. D.</given-names></name> <name><surname>Donkin</surname> <given-names>C.</given-names></name></person-group> (<year>2018</year>). <article-title>When extremists win: cultural transmission via iterated learning when populations are heterogeneous</article-title>. <source>Cogn. Sci</source>. <volume>42</volume>, <fpage>2108</fpage>&#x02013;<lpage>2149</lpage>. <pub-id pub-id-type="doi">10.1111/cogs.12667</pub-id><pub-id pub-id-type="pmid">30062733</pub-id></citation></ref>
<ref id="B26">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Quinn</surname> <given-names>M.</given-names></name></person-group> (<year>2001</year>). <article-title>&#x0201C;Evolving communication without dedicated communication channels,&#x0201D;</article-title> in <source>Advances in Artificial Life: 6th European Conference, September 10-14, 2001. Proceedings</source> (<publisher-loc>Cham</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>357</fpage>&#x02013;<lpage>366</lpage>. <pub-id pub-id-type="doi">10.1007/3-540-44811-X_38</pub-id></citation>
</ref>
<ref id="B27">
<citation citation-type="web"><person-group person-group-type="author"><name><surname>Ren</surname> <given-names>Y.</given-names></name> <name><surname>Guo</surname> <given-names>S.</given-names></name> <name><surname>Labeau</surname> <given-names>M.</given-names></name> <name><surname>Cohen</surname> <given-names>S. B.</given-names></name> <name><surname>Kirby</surname> <given-names>S.</given-names></name></person-group> (<year>2020</year>). <article-title>&#x0201C;Compositional languages emerge in a neural iterated learning model,&#x0201D;</article-title> in <source>International Conference on Learning Representations (ICLR)</source>. virtual. Available online at: <ext-link ext-link-type="uri" xlink:href="https://iclr.cc/virtual_2020/index.html">https://iclr.cc/virtual_2020/index.html</ext-link></citation>
</ref>
<ref id="B28">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Roberts</surname> <given-names>G.</given-names></name></person-group> (<year>2010</year>). <article-title>An experimental study of social selection and frequency of interaction in linguistic diversity</article-title>. <source>Interact. Stud</source>. <volume>11</volume>, <fpage>138</fpage>&#x02013;<lpage>159</lpage>. <pub-id pub-id-type="doi">10.1075/is.11.1.06rob</pub-id></citation>
</ref>
<ref id="B29">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Scott-Phillips</surname> <given-names>T. C.</given-names></name> <name><surname>Kirby</surname> <given-names>S.</given-names></name> <name><surname>Ritchie</surname> <given-names>G. R.</given-names></name></person-group> (<year>2009</year>). <article-title>Signalling signalhood and the emergence of communication</article-title>. <source>Cognition</source> <volume>113</volume>, <fpage>226</fpage>&#x02013;<lpage>233</lpage>. <pub-id pub-id-type="doi">10.1016/j.cognition.2009.08.009</pub-id></citation>
</ref>
<ref id="B30">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Steels</surname> <given-names>L.</given-names></name></person-group> (<year>1999</year>). <article-title>The spontaneous self-organization of an</article-title>. <source>Mach. Intell</source>. 15, 205. <pub-id pub-id-type="doi">10.1093/oso/9780198538677.003.0011</pub-id></citation>
</ref>
<ref id="B31">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Steels</surname> <given-names>L.</given-names></name></person-group> (<year>2015</year>). <source>The Talking Heads experiment: Origins of Words and Meanings</source>. <publisher-loc>Berlin</publisher-loc>: <publisher-name>Language Science Press</publisher-name>. <pub-id pub-id-type="doi">10.26530/OAPEN_559870</pub-id></citation>
</ref>
<ref id="B32">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Steels</surname> <given-names>L.</given-names></name> <name><surname>Belpaeme</surname> <given-names>T.</given-names></name></person-group> (<year>2005</year>). <article-title>Coordinating perceptually grounded categories through language: a case study for colour</article-title>. <source>Behav. Brain Sci</source>. <volume>28</volume>, <fpage>469</fpage>&#x02013;<lpage>488</lpage>. <pub-id pub-id-type="doi">10.1017/S0140525X05000087</pub-id><pub-id pub-id-type="pmid">16209771</pub-id></citation></ref>
<ref id="B33">
<citation citation-type="book"><person-group person-group-type="author"><name><surname>Taniguchi</surname> <given-names>T.</given-names></name></person-group> (<year>2021</year>). <article-title>&#x0201C;On parallelism in music and language: a perspective from symbol emergence systems based on probabilistic generative models,&#x0201D;</article-title> in <source>International Symposium on Computer Music Multidisciplinary Research</source> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>9</fpage>&#x02013;<lpage>25</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-031-35382-6_2</pub-id></citation>
</ref>
<ref id="B34">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taniguchi</surname> <given-names>T.</given-names></name></person-group> (<year>2023</year>). <article-title>Collective predictive coding hypothesis: Symbol emergence as decentralized bayesian inference</article-title>. <source>PsyArXiv</source> [preprint]. <pub-id pub-id-type="doi">10.31234/osf.io/d2ty6</pub-id></citation>
</ref>
<ref id="B35">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taniguchi</surname> <given-names>T.</given-names></name> <name><surname>Nagai</surname> <given-names>T.</given-names></name> <name><surname>Nakamura</surname> <given-names>T.</given-names></name> <name><surname>Iwahashi</surname> <given-names>N.</given-names></name> <name><surname>Ogata</surname> <given-names>T.</given-names></name> <name><surname>Asoh</surname> <given-names>H.</given-names></name> <etal/></person-group>. (<year>2016</year>). <article-title>Symbol emergence in robotics: a survey</article-title>. <source>Adv. Robot</source>. <volume>30</volume>, <fpage>706</fpage>&#x02013;<lpage>728</lpage>. <pub-id pub-id-type="doi">10.1080/01691864.2016.1164622</pub-id></citation>
</ref>
<ref id="B36">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taniguchi</surname> <given-names>T.</given-names></name> <name><surname>Nakamura</surname> <given-names>T.</given-names></name> <name><surname>Suzuki</surname> <given-names>M.</given-names></name> <name><surname>Kuniyasu</surname> <given-names>R.</given-names></name> <name><surname>Hayashi</surname> <given-names>K.</given-names></name> <name><surname>Taniguchi</surname> <given-names>A.</given-names></name> <etal/></person-group>. (<year>2020</year>). <article-title>Neuro-serket: development of integrative cognitive system through the composition of deep probabilistic generative models</article-title>. <source>New Gener. Comput</source>. <volume>38</volume>, <fpage>23</fpage>&#x02013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1007/s00354-019-00084-w</pub-id></citation>
</ref>
<ref id="B37">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taniguchi</surname> <given-names>T.</given-names></name> <name><surname>Ugur</surname> <given-names>E.</given-names></name> <name><surname>Hoffmann</surname> <given-names>M.</given-names></name> <name><surname>Jamone</surname> <given-names>L.</given-names></name> <name><surname>Nagai</surname> <given-names>T.</given-names></name> <name><surname>Rosman</surname> <given-names>B.</given-names></name> <etal/></person-group>. (<year>2018</year>). <article-title>Symbol emergence in cognitive developmental systems: a survey</article-title>. <source>IEEE Trans. Cogn. Dev. Syst</source>. <volume>11</volume>, <fpage>494</fpage>&#x02013;<lpage>516</lpage>. <pub-id pub-id-type="doi">10.1109/TCDS.2018.2867772</pub-id></citation>
</ref>
<ref id="B38">
<citation citation-type="journal"><person-group person-group-type="author"><name><surname>Taniguchi</surname> <given-names>T.</given-names></name> <name><surname>Yoshida</surname> <given-names>Y.</given-names></name> <name><surname>Matsui</surname> <given-names>Y.</given-names></name> <name><surname>Le Hoang</surname> <given-names>N.</given-names></name> <name><surname>Taniguchi</surname> <given-names>A.</given-names></name> <name><surname>Hagiwara</surname> <given-names>Y.</given-names></name> <etal/></person-group>. (<year>2023</year>). <article-title>Emergent communication through metropolis-hastings naming game with deep generative models</article-title>. <source>Adv. Robot</source>. <volume>37</volume>, <fpage>1</fpage>&#x02013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1080/01691864.2023.2260856</pub-id></citation>
</ref>
</ref-list>
</back>
</article>