
Colon tumor endothelial cells (CTECs) plays substantial roles to induce immune invasion, angiogenesis and metastasis. Thus, identification of the CTECs-derived transcriptomes could be helpful for colon cancer diagnosis and potential therapy.
By analysis of CTECs-derived gene expression profiling dataset, we identified differentially expressed genes (DEGs) between CTECs and colon normal endothelial cells (CNECs). In addition, we identified the significant pathways and protein-protein interaction (PPI) network that was significantly associated with the DEGs. Furthermore, we identified hub genes whose expression was significantly associated with prognosis and immune cell infiltrations in colon cancer. Finally, we identified the significant correlations between the prognostic hub genes and immune-inhibitory markers in colon cancer.
We identified 362 DEGs in CTECs relative to the CNECs, including117 up-regulated genes and 245 down-regulated genes in the CTECs. In addition, we identified significantly up-regulated pathways in CTECs that were mainly involved in cancer and immune regulation. Furthermore, we identified hub genes (such as SPARC, COL1A1, COL1A2 and IGFBP3) that are associated with prognosis and immune cells infiltrations in colon cancer. Interestingly, we found that prognosis-associated hub genes (SPARC, COL1A1, COL1A2 and IGFBP3) are positively correlated with immune-inhibitory markers of various immunosuppressive cells, including TAM, M2 macrophage, Tregs and T cell exhaustion. Finally, our findings revealed that prognosis-associated upregulated hub genes are positively correlated with immune checkpoint markers, including PD-L1 and PD-L2 and the immunosuppressive markers including TGFB1 and TGFBR1.
The identification of CTECs-specific transcriptomes may provide crucial insights into the colon tumor microenvironment that mediates the development of colon cancer.
Citation: Jie Wang, Md. Nazim Uddin, Rehana Akter, Yun Wu. Contribution of endothelial cell-derived transcriptomes to the colon cancer based on bioinformatics analysis[J]. Mathematical Biosciences and Engineering, 2021, 18(6): 7280-7300. doi: 10.3934/mbe.2021360
[1] | Zhiyan Xing, Yanlong Yang, Zuopeng Hu . Nash equilibrium realization of population games based on social learning processes. Mathematical Biosciences and Engineering, 2023, 20(9): 17116-17137. doi: 10.3934/mbe.2023763 |
[2] | Rui Huang, Hao Xiao, Guoqin Pan . Authority decentralization and air pollution reduction: Evidence from China. Mathematical Biosciences and Engineering, 2022, 19(12): 14212-14231. doi: 10.3934/mbe.2022661 |
[3] | Stephen Tully, Monica-Gabriela Cojocaru, Chris T. Bauch . Multiplayer games and HIV transmission via casual encounters. Mathematical Biosciences and Engineering, 2017, 14(2): 359-376. doi: 10.3934/mbe.2017023 |
[4] | Sharon M. Cameron, Ariel Cintrón-Arias . Prisoner's Dilemma on real social networks: Revisited. Mathematical Biosciences and Engineering, 2013, 10(5&6): 1381-1398. doi: 10.3934/mbe.2013.10.1381 |
[5] | Yueqi Mao, Qiang Mei, Peng Jing, Xingyue Wang, Ying Xue, Ye Zha . Uncovering the behavioral determinants behind private car purchase intention during the new normal of COVID-19: An empirical investigation in China. Mathematical Biosciences and Engineering, 2023, 20(4): 7316-7348. doi: 10.3934/mbe.2023318 |
[6] | Dario Madeo, Chiara Mocenni, Jean Carlo Moraes, Jorge P. Zubelli . The role of self-loops and link removal in evolutionary games on networks. Mathematical Biosciences and Engineering, 2019, 16(5): 5287-5306. doi: 10.3934/mbe.2019264 |
[7] | Yuanyuan Huang, Yiping Hao, Min Wang, Wen Zhou, Zhijun Wu . Optimality and stability of symmetric evolutionary games with applications in genetic selection. Mathematical Biosciences and Engineering, 2015, 12(3): 503-523. doi: 10.3934/mbe.2015.12.503 |
[8] | Jianjun Long, Hui Huang . Stability of equilibrium production-price in a dynamic duopoly Cournot-Bertrand game with asymmetric information and cluster spillovers. Mathematical Biosciences and Engineering, 2022, 19(12): 14056-14073. doi: 10.3934/mbe.2022654 |
[9] | Jiajia Zhang, Yuanhua Qiao, Yan Zhang . Stability analysis and optimal control of COVID-19 with quarantine and media awareness. Mathematical Biosciences and Engineering, 2022, 19(5): 4911-4932. doi: 10.3934/mbe.2022230 |
[10] | Anthony Morciglio, R. K. P. Zia, James M. Hyman, Yi Jiang . Understanding the oscillations of an epidemic due to vaccine hesitancy. Mathematical Biosciences and Engineering, 2024, 21(8): 6829-6846. doi: 10.3934/mbe.2024299 |
Colon tumor endothelial cells (CTECs) plays substantial roles to induce immune invasion, angiogenesis and metastasis. Thus, identification of the CTECs-derived transcriptomes could be helpful for colon cancer diagnosis and potential therapy.
By analysis of CTECs-derived gene expression profiling dataset, we identified differentially expressed genes (DEGs) between CTECs and colon normal endothelial cells (CNECs). In addition, we identified the significant pathways and protein-protein interaction (PPI) network that was significantly associated with the DEGs. Furthermore, we identified hub genes whose expression was significantly associated with prognosis and immune cell infiltrations in colon cancer. Finally, we identified the significant correlations between the prognostic hub genes and immune-inhibitory markers in colon cancer.
We identified 362 DEGs in CTECs relative to the CNECs, including117 up-regulated genes and 245 down-regulated genes in the CTECs. In addition, we identified significantly up-regulated pathways in CTECs that were mainly involved in cancer and immune regulation. Furthermore, we identified hub genes (such as SPARC, COL1A1, COL1A2 and IGFBP3) that are associated with prognosis and immune cells infiltrations in colon cancer. Interestingly, we found that prognosis-associated hub genes (SPARC, COL1A1, COL1A2 and IGFBP3) are positively correlated with immune-inhibitory markers of various immunosuppressive cells, including TAM, M2 macrophage, Tregs and T cell exhaustion. Finally, our findings revealed that prognosis-associated upregulated hub genes are positively correlated with immune checkpoint markers, including PD-L1 and PD-L2 and the immunosuppressive markers including TGFB1 and TGFBR1.
The identification of CTECs-specific transcriptomes may provide crucial insights into the colon tumor microenvironment that mediates the development of colon cancer.
Research on human helping behavior focuses on a series of core questions: Why and when do people help? Who does help? How can we reduce apathy and increase helping behavior? How do we improve the chance of successful help-seeking? [1]. These issues are critical to building a harmonious society of mutual assistance.
Social exchange theory [2,3] proposes that human social behavior results from an exchange process to maximize benefits and minimize costs. This theory suggests that the reasons for helping behaviors include external rewards, internal rewards, and social norms. Among them, internal rewards include alleviating a sense of guilt, happiness from a good mood, and bringing a sense of achievement, etc. Two fundamental concepts related to internal rewards are self-awareness and politeness. These two factors are closely related to the sense of guilt, achievement, and happiness on both sides of the helping behavior. However, existing research rarely touches on the connection of self-awareness and politeness to human help-seeking and help-giving behaviors, especially from the perspective of psychological game theory.
The conceptualization of self-awareness is complicated [4,5,6,7], and includes both intrapersonal and interpersonal perspectives [4,5,6,7]. Some researchers use the distinction between private and public aspects to describe its intra- and interpersonal aspects [8,9,10]. In these studies, the private aspect involves paying attention to one's inner thoughts and feelings, and the public aspect is the general perception of the self as a social object that influences others [11]. According to Carden et al., "Self-awareness consists of a range of components, which can be developed through focus, evaluation, and feedback, and provides an individual with an awareness of their internal state (emotions, cognitions, physiological responses), that drives their behaviors (beliefs, values, and motivations) and an awareness of how this impacts and influences others" [4]. The self-awareness related to help-seeking and help-giving behavior, applying the self-awareness definition given by Carden et al., includes a range of interpersonal components and intrapersonal components to develop connections between self and helpers or help seekers, it is developed through focus, evaluation, and feedback, and provides an individual with an intrapersonal aspect of self-awareness that drives their behaviors and the interpersonal aspect of self-awareness [4,6]. The interpersonal aspect of self-awareness leads people to pay attention to publicly displayed aspects of the self [12,13]. People pay attention to how others perceive them based on their behavior, etc. [14], and they are more likely to change their minds and behaviors when others are present [15,16,17]. Based on the above discussion, we identified self-awareness as one of the factors influencing helping behavior in this study. That is, helpers with a high level of self-awareness are strongly aware of other people's behavior and reflect on their own behavior when they are asked for help, so they change their behavior. Conversely, helpers with a low level of self-awareness generally are unaware of their own and others' behavior, so they don't change their behavior. In the same way, the above discussion also applies to help seekers [18]. Going a step further, when helpers with a high level of self-awareness are asked for help, they will concern about the help seekers' perceptions. Self-awareness promotes the belief that one has a relatively great personal responsibility for others and tends to increase helpfulness [19,20,21,22,23]. For help seekers, self-awareness is an essential reason for the embarrassment [24]. When help seekers with a high level of self-awareness cannot give back, they will feel belittled because they receive help. Therefore, people with a high level of self-awareness are often reluctant to seek help [25,26,27].
Politeness refers to people applying good manners or etiquette [28]. An understanding of politeness requires an understanding of its psychosocial underpinnings. At the same time, understanding the corresponding psychosocial phenomena can also be improved by studying the role of politeness in these psychosocial processes [29,30]. Politeness theory proposes that politeness can both indicate and create social distance [29,31,32]. Politeness is relevant to several research areas in social psychology, including person perception and impression management [29]. When people hold prosocial and impression management motivation, they attach importance to two results: helping others and improving their own image [33]. The desire to maintain a good image can stimulate helping behavior [34]. If the level of politeness of helpers is high, they would care more about their image and feel sympathy for help seekers when asked for help, so they would tend to help [35]. For help seekers, if they care about making trouble for others too much, it's hard to seek help [36]. If help-seeking is low yield and high cost to helpers, help seekers would also have negative emotions such as debt and apology [37]. They are afraid they will not be able to repay and are ungrateful. This politeness, as human nature, will affect people's help-seeking behavior.
Game theory refers to a theoretical framework for envisioning social situations between competing players, which implies optimal decisions for independent and competing players in an environment [38]. As a model of interactive situations between players, the game theory focuses on games where one player's payoff depends on another player's strategy [39]. Games identify players' identities, preferences, and available strategies and focus on the impact of those strategies on outcomes [40]. We establish a psychological game theory model to analyze people's help-seeking and help-giving behavior. According to the Bayesian Nash Equilibrium in this study, given the help seeker and helper characteristics, that is, the probability distribution of self-awareness and politeness, each person will choose the strategy that maximizes his/her expected utility.
This study aims to link two related social psychology concepts, self-awareness and politeness, with human helping behavior and demonstrate using a game-theory-based Bayesian Nash equilibrium approach. This study is thus expected to make the following potential contributions: First, this study would illustrate the influence of self-awareness and politeness on help-seeking and help-giving when people are in trouble. Second, this study would be able to clarify the relationship between politeness, self-awareness, and the willingness of the help seekers as well as the helpers. Third, this study will compare the results obtained by the method of Bayesian Nash equilibrium based on a psychological game in this study with the results obtained by the method of psychological experiments in previous studies, to verify the conclusion of social psychology about the influence of self-awareness and politeness on helping behavior, through the mathematical method of psychological game theory.
In this study, we firstly established a game theory model, which was proposed by Harsanyi [41] and adopted by many researchers, such as Myatt and Wallace; Huang and Zhu [42,43].
The characters on the stage are player A as a help-seeker and player B as a helper. Player A can be people with the low ability signed as L or high ability signed as H. Player B can also be people with low ability or high ability. Low ability and high ability are basic settings in this study. Therefore, the utility function of each player is:
U=U1+U2+U3 |
U1 is the utility of the actual cost paid. U1 is related to the basic cost c and the ability cost of that player, thus, U1=−ac; from player A's point of view, if player B does not help him, he/she has to work on it by himself; that is UA1=−aAc; If Player B helps, he/she can do it without effort; that is UA1=0; from player B's point of view, if he/she helps player A, he/she has to make his/her own efforts, that is UB1=−aBc; If he/she does not help, he/she does not have to make an effort; that is UB1=0. The player with high ability costs less; on the contrary, the player with low ability costs more.
U2 is the utility of self-awareness, which is related to the degree of self-awareness; represented by α, and the speculation about how others think of himself, represented by E(a). Thus, U2=−α[E(a)−a]. EB(aA−Seek) means player B speculates on player A's ability when player A seeks help; EB(aA−Not seek) means player B speculates on player A's ability when player A does not seek help; EA(aB−Help) means player A speculates on player B's ability when player B helps; EA(aB−Not help) means player A speculates on player B's ability when player B does not help. U3 is the effect of politeness, and the degree of politeness β (0 < β < 1) is related to the basic cost and his actual ability, thus, U3=−βca.
Player A's utility in seeking help is:
UA−Seek=−αA[EB(aA−Seek)−aA]−βAcaB |
Player A's utility when he/she does not seek help is:
UA−Not seek=−aAc−αA[EB(aA−Not seek)−aA] |
Player B's utility when he/she helps is:
UB−Help=−aBc−αB[EA(aB−Help)−aB] |
Player B's utility when he/she does not help is:
UB−Not help=−αB[EA(aB−Not help)−aB]−βBcaA |
When the difference between the ability predicted by others and his actual ability is positive, it is α1; and when it is negative, it becomes α2. The relationship between α1 and α2 is 0<α1<α2. The game tree is as follows:
The probability of LA with high ability is PA; The probability of HA with low ability is (1−PA); LA 's probability of seeking help is q; its probability of not seeking help 1−q; The probability of HA 's help-seeking is q′; Its probability of not seeking help is 1−q′. Let the probability of LA be PA, the probability of HA be (1−PA). Let the probability of LB be PB, the probability of HB be (1−PB). The probability of LB giving help is r′, its probability of not helping is 1−r′. The probability of HB giving help is r, its probability of not helping is 1−r. Thus, the belief of players A and B at each point is:
γ=(1-PB)qPAqPA(1-PB)+q′(1-PB)(1-PA)=qPAqPA+q′(1-PA);1−γ=q′(1-PA)qPA+q′(1-PA);ρ=PBqPAqPAPB+q′PB(1-PA)=qPAqPA+q′(1-PA);1−ρ=q′(1-PA)qPA+q′(1-PA);ε=(1-PB)qPArqPA(1-PB)r+qPBPAr′=(1-PB)r(1-PB)r+PBr′;1−ε=PBr′(1-PB)r+PBr′;μ=(1-PB)(1-PA)q′rq′(1-PB)(1-PA)r+q′PB(1-PA)r′=(1-PB)r(1-PB)r+PBr′;1−μ=PBr′(1-PB)r+PBr′;θ=(1-PB)PAq(1−r)q(1-PB)PA(1−r)+qPBPA(1−r′)=(1-PB)(1−r)(1-PB)(1−r)+PB(1−r′);1−θ=PB(1−r′)(1-PB)(1−r)+PB(1−r′);π=(1-PB)(1−PA)q′(1−r)q′(1-PB)(1−PA)(1−r)+q′PB(1−PA)(1−r′)=(1-PB)(1−r)(1-PB)(1−r)+PB(1−r′);1−π=PB(1−r′)(1-PB)(1−r)+PB(1−r′);δ=(1−q)PA(1-PB)(1−q)PA(1-PB)+(1−q′)(1-PB)(1-PA)=(1−q)PA(1−q)PA+(1−q′)(1-PA);1−δ=(1−q′)(1-PB)(1-PA)(1−q)PA(1-PB)+(1−q′)(1-PB)(1-PA)=(1−q′)(1-PA)(1−q)PA+(1−q′)(1-PA) |
Therefore, if player A seeks help, player B is in two situations: help or not help. Take the utility of player A when player B helps as UAseekO, and the utility of player A when player B does not help A as UAseekX. Thus,
UA−SeekO=−αA[EB(aA−Seek)−aA]−βAcaB |
UA−SeekX=−aAc−αA[EB(aA−Seek)−aA] |
Player A's utility is:
UA−Seek=PB[r′UA−SeekO+(1−r′)UA−SeekX]+ |
(1−PB)[rUA−SeekO+(1−r)UA−SeekX] |
UA−Not seek=−aAc−αA[EB(aA−Not seek)−aA] |
In the case of HA with high ability:
[EB(aA−Seek)−HA]=(1−PB)[LAγ+HA(1−γ)]+PB[LAρ+HA(1−ρ)]−HA |
=[LAγ+HA(1−γ)]−HA>0 |
[EB(aA−Not seek)−HA]=(1−PB)[LAδ+HA(1−δ)]+PB[LAσ+HA(1−σ)]−HA |
=[LAδ+HA(1−δ)]−HA>0 |
Therefore, αA of both parties is αA1. Player A's utility in seeking help is:
UA−Seek=PB[r′UA−SeekO+(1−r′)UA−SeekX] |
+(1−PB)[rUA−SeekO+(1−r)UA−SeekX] |
=[PBr′+(1−PB)r]{−αA1[[LAγ+HA(1−γ)]−HA]−βAcaB}+[PB(1−r′)+(1−PB)(1−r)]{−cHA−αA1[[LAγ+HA(1−γ)]−HA]} |
Player A's utility when he/she does not seek help is:
UA−Not seek=−aAc−αA[EB(aA−Not seek)−aA] |
=−HAc−αA1[[LAδ+HA(1−δ)]−HA] |
In the case of LA with low ability:
[EB(aA−seek)−LA]=(1−PB)[LAγ+HA(1−γ)]+PB[LAρ+HA(1−ρ)]−LA |
=[LAγ+HA(1−γ)]−LA<0 |
[EB(aA−Not seek)−HA]=(1−PB)[LAδ+HA(1−δ)]+PB[LAσ+HA(1−σ)]−LA |
=[LAδ+HA(1−δ)]−LA<0 |
Therefore, αA of both parties are αA2. When player A seeks help, the utility is:
UA−Seek=PB[r′UA−SeekO+(1−r′)UA−SeekX] |
+(1−PB)[rUA−SeekO+(1−r)UA−SeekX] |
=[PBr′+(1−PB)r]{−αA2[[LAγ+HA(1−γ)]−LA]−βAcaB}+[PB(1−r′)+(1−PB)(1−r)]{−cLA−αA2[[LAγ+HA(1−γ)]−LA]} |
Player A's utility when he/she does not seek help is:
UA−Not Seek=−LAc−αA2[[LAδ+HA(1−δ)]−LA] |
In the case of HB with high ability:
[EA(aB−Help)−aB]=PA[LB(1−ε)+HBε]+(1−PA)[LB(1−μ)+HBμ]−HB |
=LB(1−ε)+HBε−HB>0 |
[EA(aB−Not help)−HB]=PA[LB(1−θ)+HBθ]+(1−PA)[LB(1−π)+HBπ]−HB |
=LB(1−θ)+HBθ−HB>0 |
Therefore, αB of both parties are αB1. At this time, the utility of player B when he/she helps is:
UB−Help=−HBc−αB1[EA(aB−Help)−HB] |
=−HBc−αB1[LB(1−ε)+εHB−HB] |
The utility of player B when he/she does not help is:
UB−Not help=−αB1[EA(aB−Not help)−HB]−βBcaA |
=−αB1[LB(1−θ)+HBθ−HB]−βBcaA |
In the case of LB :
[EA(aB−help)−aB]=PA[LB(1−ε)+HBε]+(1−PA)[LB(1−μ)+HBμ]−LB |
=LB(1−ε)+HBε−LB<0 |
[EA(aB−not help)−aB]=PA[LB(1−θ)+HBθ]+(1−PA)[LB(1−π)+HBπ]−LB |
=LB(1−θ)+HBθ−LB<0 |
Therefore, αB of both parties are αB1. At this time, the utility of player B when he/she helps is:
UB−Help=−LBc−αB2[EA(aB−Help)−LB] |
=−LBc−αB2[LB(1−ε)+εHB−LB] |
The utility of player B when he/she does not help is:
UB−Not help=−αB2[EA(aB−Not help)−LB]−βBcaA |
=−αB2[LB(1−θ)+HBθ−LB]−βBcaA |
Equilibrium analysis examines what happens when the system reaches equilibrium and the conditions required to achieve equilibrium [44]. Equilibrium analysis is critical in game theory because game equilibrium refers to the realization of the maximum utility of each party in the game, that is, to achieve the satisfaction of each party with the game result so that the actual utility and degree of satisfaction obtained by each party are different. In game equilibrium, such a relatively static state is in which all players do not want to change their strategies [45].
Bayesian Nash Equilibrium refers to a set of strategies: given the probability distribution of a player's own characteristics and the characteristics of other players, each player chooses a strategy to maximize his expected payoff; that is, no one has the incentive to choose other strategies [46]. This study uses a Bayesian Nash equilibrium to analyze the game between the helper and the help seeker.
Therefore, the player's decision-making goal is to maximize his/her expected utility given his/her own type and the relationship between the other player's types and strategic choices. Bayesian Nash Equilibrium is a type-dependent strategic combination [47].
We now start to analyze the equilibrium. When players A and B decide on their strategy, they would select the strategy with larger utility, thus this study should compare the difference in the utility of players' different selections.
Furthermore, player B with high ability can expect player A's ability as aA=γLA+(1−γ)HA.The ability of player B with low ability can expect player A's ability as aA=ρLA+(1−ρ)HA. We thus substitute them into the utility function. In addition, Player A with either the high ability or low ability would decide to seek help or not; player B with either the high ability or low ability would decide to help or not. When player A is helped by player B with high ability, r=1; when player B with high ability does not help, r=0; when player B with low ability helps, r′=1; when player B with low ability does not help, r′=0; when player A with low ability seeks for help, q=1; when player A with low ability does not seek for help, q=0; when player A with high ability seeks for help, q′=1, when player A with high ability does not seek for help, q′=0. In summary, there are situations including r=1,r=0,r′=1,r′=0,q=1,q=0,q′=1,q′=0. As a result, there are 16 combinations. According to calculating, there are nine equilibriums. The following section will discuss these equilibriums. For example, the first equilibrium is stated as follows: HB help; LB not help; LA seek; HA not seek.
1) r=1,r′=0,q=1,q′=1
In the case of HB:
UB−Help−UB−Not help=αB1(LB−HB)+c(βB[PALA+(1−PA)HA]−HB) |
In order to meet the condition UB−Help−UB−Not help>0, there must be:
βB>−αB1(LB−HB)c[PALA+(1−PA)HA]+HB[PALA+(1−PA)HA] |
The relationship between βB and αB1 is shown in the following figure:
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)+c(βBaA−LB) |
In order to meet the condition UB−help−UB−not help<0, there must be:
βB<−αB2(LB−HB)c[PALA+(1−PA)HA]+LBPALA+(1−PA)HA |
The relationship between βB and αB2 is shown in the following figure:
Next, let HB = HA,LB = LA,PB = PA,αB1=αA1 = α1,αB2=αA2 = α2,βA=βB. In this case, set the difference between α1 and α2 to ξ. Thus, α2−α1=ξ. Because player B must meet the conditions of HB and LB, we thus find the union set of HB and LB. To put the two figures above together, we must distinguish occasions between cLBLB−HB−ξ>cHBLB−HB as case 1B and cLBLB−HB−ξ<cHBLB−HB as case 2B. At this point:
In the case of HA:
UA−Seek−UA−Not seek=−αA1(γ−δ)(LA−HA)+(1−PB)c(HA−βAHB); |
Therefore, in order to meet the condition UA−Seek−UA−Not seek>0, there must be:
βA<−αA1(γ−δ)(LA−HA)cHB(1−PB)+HAHB. |
Because there are (γ−δ)>0 and (γ−δ)<0, The relationship between βA and αA1 is shown in the following figure:
In the case of LA:
UA−Seek−UA−Not seek=−αA2(γ−δ)(LA−HA)+(1−PB)c(LA−βAaB) |
=−αA2(γ−δ)(LA−HA)+(1−PB)c(LA−βAHB]) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek>0, there must be:
βA<−αA2(γ−δ)(LA−HA)cHB(1-PB)+LAHB |
Because there are (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA2 is shown in the following figure:
Because player B must meet the conditions of HA and LA, we thus find the union set of HA and LA. Owing to ξ>0, −cLA(1−PB)LA−HA−ξ must be less than −cHA(1−PB)LA−HA. Therefore:
Players A and B must satisfy all of the conditions of the game equilibrium case 1B or case 2B. Thus, the result that satisfies the conditions of players A and B is 0 < ξ < C. The figure is as follows:
2) r=1,r′=0,q=1,q′=0
In the case of HB:
UB−Help−UB−Not help=αB1(LB−HB)+c(βBLA−HB) |
Therefore, in order to meet the condition UB−help−UB−not help>0, there must be:
βB>−αB1(LB−HB)cLA+HBLA |
The relationship between βB and αB1 is shown in the following figure:
In the case of LB:
UB−Help−UB−Not help=αB2(LB−HB)+c(βBLA−LB) |
Therefore, in order to meet the condition UB−help−UB−not help<0, there must be:
βB<−αB2(LB−HB)cLA+LBLA |
The relationship between βB and αB2 is shown in the following figure:
To put the two figures above together, we must distinguish occasions between cLBLB−HB−ξ>cHBLB−HB as case 1B and cLBLB−HB−ξ<cHBLB−HB as case 2B.
At this point:
In the case of HA :
UA−Seek−UA−Not seek=−αA1(LA−HA)+(1−PB)c(HA−βAHB) |
Therefore, in order to meet the condition UA−seek−UA−not seek<0, there must be:
βA>−αA1(LA−HA)c(1−PB)HB+1 |
The relationship between βA and αA1 is shown in the following figure:
In the case of LA:
UA−Seek−UA−Not seek=−αA2(LA−HA)+(1−PB)c(LA−βAHB) |
Therefore, in order to meet the condition UA−seek−UA−not seek>0, there must be:
βA<−αA2(LA−HA)cHB(1-PB)+LAHB |
The relationship between βA and αA2 is shown in the following figure:
To put the two figures above together, we must distinguish occasions between cLA(1−PB)LA−HA−ξ>cHA(1−PB)LA−HA as case 1A and cLA(1−PB)LA−HA−ξ<cHA(1−PB)LA−HA as case 2A. At this point:
Player A must satisfy all of the conditions of the game equilibrium case 1A. Player B must satisfy all of the conditions of the game equilibrium case 1B. To satisfy both case 1A and case 1B, there must be 0<ξ<c(1−PB). The figure is as follows:
3) r=1,r′=0,q=0,q′=0
In the case of HB:
UB−Help−UB−Not help=αB1(LB−HB)+c(βB[γLA+(1−γ)HA]−HB) |
Therefore, in order to meet the condition UB−Help−UB−Not help>0, there must be:
βB>−αB1(LB−HB)c[γLA+(1−γ)HA]+HBγLA+(1−γ)HA |
The relationship between βB and αB1 is shown in the following figure:
In the case of LB:
UB−Help−UB−Not help=αB2(LB−HB)+c(βB[ρLA+(1−ρ)HA]−LB) |
Therefore, in order to meet the condition UB−Help−UB−Not help<0, there must be:
βB<−αB2(LB−HB)c[ρLA+(1−ρ)HA]+LBρLA+(1−ρ)HA |
The relationship between βB and αB2 is shown in the following figure:
To put the two figures above together, we must distinguish occasions between cLBLB−HB−ξ>cHBLB−HB as case 1B and cLBLB−HB−ξ<cHBLB−HB as case 2B. At this point:
In the case of HA:
UA−Seek−UA−Not seek=−αA1(γ−δ)(LA−HA)+(1−PB)c(HA−βAHB) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek<0, there must be:
βA>−αA1(γ−δ)(LA−HA)cHB(1-PB)+1 |
When (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA1 is shown in the following figure:
In the case of LA :
UA−Seek−UA−Not seek=−αA2(γ−δ)(LA−HA)+(1−PB)c(LA−βAHB) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek<0, there must be:
βA>−αA2(γ−δ)(LA−HA)cHB(1-PB)+LAHB |
When (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA2 is shown in the following figure:
Owing to:
α2−α1=ξ, cLA(1−PB)LA−HA−ξ>cHB(1−PB)(LA−HA) as case 1A,cLA(1−PB)LA−HA−ξ<cHB(1−PB)LA−HA as case 2A are as follows:
Player A must satisfy all of the conditions of the game equilibrium case 1A and player B must satisfy all of the conditions of the game equilibrium case 1B and case 2B. Because case 2B is an empty set, the union set of case 2B and case 1A is also an empty set. To satisfy both case 1B and case 1A, there must be 0<ξ<c(1−PB). To satisfy both case 1B and case 2A, there must be c(1−PB)<ξ<c. Both of them are shown in the following figure:
4) r=0,r′=0,q=1,q′=1
In the case of HB:
UB−Help−UB−Not help=αB1(LB−HB)[ε−(1−PB)]+c(βB[PALA+(1−PA)HA]−HB) |
Therefore, in order to meet the condition UA−Help−UA−Not help<0, there must be:
βB<−αB1(LB−HB)[ε−(1−PB)]c[PALA+(1−PA)LA]+HBPALA+(1−PA)LA |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB1 is shown in the following figure:
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)[ε−(1−PB)]+c{βB[PALA+(1−PA)HA]−LB} |
Therefore, in order to meet the condition UB−Help−UB−Not help<0, there must be:
βB<−αB2(LB−HB)[ε−(1−PB)]c[PALA+(1−PA)HA]+LB[PALA+(1−PA)HA] |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB2 is shown in the following figure:
Owing to ξ>0, −cLBLB−HB−ξ must be less than −cHBLB−HB. Therefore, the union set is:
In the case of HA:
UA−Seek−UA−Not seek=−αA1(PA−δ)(LA−HA) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek>0, there must be: (PA−δ)<0. When (γ−δ)<0, the relationship between βA and αA1 is shown in the following figure:
In the case of LA:
UA−Seek−UA−Not seek=−αA2(γ−δ)(LA−HA)+(r+PBr'−PBr)c(LA−βAaB) |
=−αA2(PA−δ)(LA−HA) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek>0, there must be: (PA−δ)<0. When (γ−δ)<0, the relationship between βA and αA2 is shown in the following figure:
The condition of player B and player A is 0<ξ. As shown in the following figure:
5) r=0,r′=0,q=0,q′=0
In the case of HB:
UB−Seek−UB−Not seek=αB1(LB−HB)[ε−(1−PB)]+c(βB[γLA+(1−γ)HA]−HB) |
Therefore, in order to meet the condition UB−Seek−UB−Not Seek<0, there must be: (βB<−αB1(LB−HB)[ε−(1−PB)]c[γLA+(1−γ)HA]+HB[γLA+(1−γ)HA], when (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB1 is shown in the following figure:
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)[ε−(1−PB)]+c{βB[ρLA+(1−ρ)HA]−LB} |
Therefore, in order to meet the condition UB−Help−UB−Not help<0, there must be:
βB<−αB2(LB−HB)[ε−(1−PB)]c[ρLA+(1−ρ)HA]+LB[ρLA+(1−ρ)HA] |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB2 is shown in the following figure:
Since ξ>0, −cLBLB−HB−ξ is always smaller than −cHBLB−HB. Thus, the union set is:
In the case of HA :
UA−Seek−UA−Not seek=−αA1(γ−PA)(LA−HA) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek<0, there must be: (γ−PA)>0, when (γ−δ)>0, the relationship between βA and αA1 is shown in the following figure:
In the case of LA :
UA−Seek−UA−Not seek=−αA2(γ−PA)(LA−HA) |
Therefore, in order to meet the condition UA−Seek−UA−Not seek<0, there must be: (γ−PA)>0, when (γ−δ)>0, the relationship between βA and αA2 is shown in the following figure:
Player B's all conditions and player A's all conditions must be met. Thus, the result is 0<ξ. The figure is shown as follows:
6) r=1,r′=1,q=0,q′=0
In the case of HB:
UB−Help−UB−Not help=αB1(LB−HB)[(1−PB)−θ]+c(βB[γLA+(1−γ)HA]−HB) |
Therefore, in order to meet the condition UB−Help−UB−Not help>0, there must be:
βB<−αB1(LB−HB)[(1−PB)−θ]c[γLA+(1−γ)HA]+HB[γLA+(1−γ)HA] |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB1 is shown in the following figure:
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)[(1−PB)−θ]+c{βB[ρLA+(1−ρ)HA]−LB} |
Therefore, in order to meet the condition UB−Help−UB−Not help>0, there must be:
βB<−αB2(LB−HB)[(1−PB)−θ]c[ρLA+(1−ρ)HA]+LB[ρLA+(1−ρ)HA] |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB2 is shown in the following figure:
To combine the two figures above together, we must distinguish occasions between cLBLB−HB−ξ>cHBLB−HB as case 1B and cLBLB−HB−ξ<cHBLB−HB as case 2B. At this time,
In the case of HA :
UA−Seek−UA−Not seek=−αA1(γ−PA)(LA−HA)+c{HA−βA[PBLB+(1−PB)HB]} |
Therefore, in order to meet the condition UA−seek−UA−not seek<0, there must be:
βA>−αA1(γ−PA)(LA−HA)c[PBLB+(1−PB)HB]+HA[PBLB+(1−PB)HB] |
When (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA1 is shown in the following figure:
In the case of LA :
UA−Seek−UA−Not seek=−αA2(γ−PA)(LA−HA)+(r+PBr'−PBr)c{LA−βA[PBLB+(1−PB)HB]} |
Therefore, in order to meet the condition UA−seek−UA−not seek<0, there must be:
βA>−αA2(γ−PA)(LA−HA)c[PBLB+(1−PB)HB]+LA[PBLB+(1−PB)HB] |
When (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA2 is shown in the following figure:
Owing to α2−α1=ξ, there is cLALA−HA−ξ>cHALA−HA as case 1A,cLALA−HA−ξ<cHALA−HA as case 2A. At this time,
Player A must satisfy all of the conditions of the game equilibrium case 1A and 2A. Player B must satisfy all of the conditions of the game equilibrium case 1B and 2B. Thus, the result of the union set of case 1B and case 1A is 0 < ξ < c. It is shown in the following figure:
Since the results of the union set of case 1B and case 2A are ξ<c, ξ>c, ξ does not exist. Since the results of the union set of case 2B and case 1A are ξ>c,ξ<c, ξ does not exist. The result of the union set of case 2B and case 2A is ξ>c. The figure is shown as follows:
7) r=1,r′=1,q=1,q′=1
In the case of HB :
UB−Help−UB−Not help=αB1(LB−HB)[(1−PB)−θ]+c(βB[γLA+(1−γ)HA]−HB) |
Therefore, in order to meet the condition UB−help−UB−not help>0, there must be:
βB<−αB1(LB−HB)[(1−PB)−θ]c[γLA+(1−γ)HA]+HB[γLA+(1−γ)HA] |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB1 is shown in the following figure:
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)[(1−PB)−θ]+c{βB[ρLA+(1−ρ)HA]−LB} |
Therefore, in order to meet the condition UB−help−UB−not help>0, there must be:
βB<−αB2(LB−HB)[(1−PB)−θ]c[ρLA+(1−ρ)HA]+LB[ρLA+(1−ρ)HA] |
When (ε−θ)>0 and (ε−θ)<0, the relationship between βB and αB2 is shown in the following figure:
To put the two figures above together, we must distinguish occasions between cLBLB−HB−ξ>cHBLB−HB as case 1B and cLBLB−HB−ξ<cHBLB−HB as case 2B. At this point:
In the case of HA :
UA−Seek−UA−Not seek=−αA1(PA−δ)(LA−HA)+c{HA−βA[PBLB+(1−PB)HB]} |
Therefore, in order to meet the condition UA−seek−UA−not seek>0, there must be:
βA>−αA1(PA−δ)(LA−HA)c[PBLB+(1−PB)HB]+HA[PBLB+(1−PB)HB] |
When (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA1 is shown in the following figure:
In the case of LA :
UA−Seek−UA−Not seek=−αA2(PA−δ)(LA−HA)+c{LA−βA[PBLB+(1−PB)HB]} |
Therefore, in order to meet the condition UA−seek−UA−not seek>0, there must be:
βA<−αA2(PA−δ)(LA−HA)c[PBLB+(1−PB)HB]+LA[PBLB+(1−PB)HB] |
When (γ−δ)>0 and (γ−δ)<0, the relationship between βA and αA2 is shown in the following figure:
Since ξ>0, −cLALA−HA−ξ is always smaller than −cHALA−HA. Thus, the union set is:
Player B must satisfy all of the conditions of the game equilibrium case 1B or case 2B, so does player A. Thus, the result that satisfies the conditions of players A and B is 0<ξ<c. The figure is:
To satisfy case 2B and player A's conditions, the result is 1>ξ>c. The figure is as follows:
8) r=1,r′=1,q=1,q′=0
In the case of HB :
UB−Help−UB−Not help=αB1(LB−HB)[(1−PB)−θ]+c(βBLA−HB) |
Therefore, in order to meet the condition UB−Help−UB−Not help>0, there must be:
βB>−αB1(LB−HB)[(1−PB)−θ]cLA+HBLA |
The relationship between βB and αB1 is shown in the following figure:
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)[(1−PB)−θ]+c(βBLA−LB) |
Therefore, in order to meet the condition UB−Help−UB−Not help>0, there must be:
βB>−αB2(LB−HB)[(1−PB)−θ]cLA+LBLA |
The relationship between βB and αB2 is shown in the following figure:
To combine the two figures above together, we must distinguish occasions between cLBLB−HB−ξ>cHBLB−HB as case 1B and cLBLB−HB−ξ<cHBLB−HB as case 2B. At this point,
In the case of HA :
UA−Seek−UA−Not seek=−αA1(LA−HA)+c{HA−βA[PBLB+(1−PB)HB]} |
Therefore, in order to meet the condition UA−Seek−UA−Not seek<0, there must be:
βA>−αA1(LA−HA)c[PBLB+(1−PB)HB]+HA[PBLB+(1−PB)HB] |
The relationship between βA and αA1 is shown in the following figure:
In the case of LA :
UA−Seek−UA−Not seek=−αA2(LA−HA)+c{LA−βA[PBLB+(1−PB)HB]} |
Therefore, in order to meet the condition UA−Seek−UA−Not seek>0, there must be:
βA<−αA2(LA−HA)c[PBLB+(1−PB)HB]+LA[PBLB+(1−PB)HB] |
The relationship between βA and αA2 is shown in the following figure:
Since α2−α1=ξ, there are: cLALA−HA−ξ>cHALA−HA as case 1A and cLALA−HA−ξ<cHALA−HA as case 2A. At this point,
Player B must satisfy all of the conditions of the game equilibrium case 1B or case 2B, player A must satisfy all of the conditions of the game equilibrium case 1A or case 2A. Because case 2A is an empty set, the union set of case 1B and case 2B is also an empty set. Thus, the result that satisfies both case 1B and case 1A is 0<ξ<c. The figure is as follows:
Since the result of the union set of case 2B and case 1A is ξ>c, ξ<c, ξ does not exist.
The above section discusses the eight equilibriums. The next section will discuss why the following eight situations are not equilibrium:
9) r=0,r′=0,q=1,q′=0
In the case of LA :
UA−Seek−UA−Not seek=−αA2(LA−HA) |
Owing to UA−Seek−UA−Not seek>0 must be satisfied, UA−Seek−UA−Not seek must be less than 0. It contradicts q=1.
10) r=0,r′=0,q=0,q′=1
In the case of LA :
UA−Seek−UA−Not seek=−αA2(−1)(LA−HA) |
Owing to −αA2(−1)(LA−HA) is always positive, UA−Seek−UA−Not seek must be greater than 0. It contradicts q=0.
11) r=1,r′=0,q=0,q′=1
In the case of LA :
UA−Seek−UA−Not seek=−αA2(−1)(LA−HA)+(1−PB)c{LA−βA[PBLB+(1−PB)HB]} |
Owing to −αA2(−1)(LA−HA) and (1−PB)c{LA−βA[PBLB+(1−PB)HB]} are always positive, UA−Seek−UA−Not seek must be greater than 0. It contradicts q=0.
12) r=0,r′=1,q=1,q′=0
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)(−1)+c(βBLA−LB) |
Owing to αB2(LB−HB)(−1) and c(βBLA−LB) are always negative, UB−Help−UB−Not help must be less than 0. It contradicts r′=1.
13) r=1,r′=1,q=0,q′=1
In the case of LA :
UA−Seek−UA−Not seek=−αA2(−1)(LA−HA)+c{LA−βA[PBLB+(1−PB)HB]} |
Owing to −αA2(−1)(LA−HA) and c{LA−βA[PBLB+(1−PB)HB]} are always positive, UA−Seek−UA−Not seek must be greater than 0. It contradicts q=0.
14) r=0,r′=1,q=1,q′=1
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)(−1)+c(βBLA−LB) |
Owing to αB2(LB−HB)(−1) and c(βBLA−LB) are always negative, UB−Help−UB−Not help must be less than 0. It contradicts r′=1.
15) r=0,r′=1,q=0,q′=0
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)(−1)+c(βBLA−LB) |
Owing to αB2(LB−HB)(−1) and c(βBLA−LB) are always negative, UB−Help−UB−Not help must be less than 0. It contradicts r′=1.
16) r=0,r′=1,q=0,q′=1
In the case of LB :
UB−Help−UB−Not help=αB2(LB−HB)(−1)+c(βBHA−LB) |
Owing to αB2(LB−HB)(−1) and c(βBHA−LB) are always negative, UB−Help−UB−Not help must be less than 0. It contradicts r′=1.
Based on the above equilibrium analysis results, the difference in self-awareness ξ is greatest when it is larger than c, and it becomes equilibriums 6) and 7). It means when the degree of risk aversion of the player is the highest, the helper always helps, regardless of the help-seekers' ability. The reason is that risk aversion helpers care more about being looked down upon than being looked up to by others. Therefore, seeking help from someone with a high level of self-awareness increases the likelihood of getting help. This is consistent with the prior studies based on psychological experiments [19,21,22]. When ξ is slightly smaller, there are equilibriums 1)–3) and 6)–8). At this time, player B, with high ability, would help. Low ability does not necessarily help. In other words, when the difference in self-awareness is medium and slightly smaller, or the degree of risk aversion decreases, only people with high ability will help others. Although people with low ability want to help others, the price of helping others is too high, so they will not help others. Under this condition, self-awareness tends to increase helpfulness. This is consistent with the prior studies based on psychological experiments [19,22,23]. When ξ is the smallest, it is equilibriums 2), 4), 6), 7) and 9). When the difference in self-awareness is minimal, that is, when the degree of risk aversion is small, high-ability help seekers tend not to seek help from others. At this time, although the seeker does not care much about being looked down upon by others, once they seek help from others, the high-ability person will also reduce their utility due to reasons related to politeness, so the high-ability seeker is more inclined to not ask for help. This is consistent with previous literature based on psychological experiments [21].
Regarding the helper, by equilibriums 4) and 5), if the self-awareness α is large, but the politeness β is very small, neither player B with high ability nor low ability would help. In other words, even if the self-awareness is relatively high, but the degree of politeness is relatively low, both high and low ability people will not help. This is consistent with the previous literature based on psychological experiments [20]. We confirmed that when self-awareness and politeness are within a certain range, people help, as shown in equilibriums 1)–3). Suppose self-awareness α and politeness β are within a specific range; in other words, when self-awareness and politeness are within a specific range. In that case, people with high ability will help, and people with low ability will not help. In equilibriums 6)–8), when self-awareness and politeness are high, the helper will choose to help others regardless of their ability. Helpers with high levels of self-awareness tend to help, consistent with previous research based on psychological experiments [19]. Besides, Helpers with high levels of politeness tend to help, consistent with previous research based on psychological experiments [33,34,35].
Concerning the help-seeker, in equilibrium 7), If politeness β is small when seeking help, either player A with low or high ability would seek help. It means when viewed from the perspective of the seeker, when the degree of politeness of the seeker is relatively low, no matter the seeker's ability, he/she will seek help from others.
In equilibriums 2) and 8), if self-awareness α and politeness β are within a specific range, which means the level of self-awareness and politeness are within a certain range, player A with high ability would not seek help. However, player A with low ability would seek help.
In equilibriums 3) and 6), when self-awareness α and politeness β are both large, either player B with the high ability or low ability would not seek help. It means when self-awareness and politeness are high, the help seeker will not ask for help, regardless of the ability of the seeker. On the one hand, help seekers with high levels of self-awareness tend not to seek help, consistent with previous research based on psychological experiments [25,26,27]. On the other hand, help seekers with high levels of politeness tend not to seek help, consistent with previous research [36,37].
In situations 12) and 14)–16) where there is no equilibrium, player B with high ability may help. While the psychological effect of self-awareness α and politeness β affect human behavior, it is impossible to force others to do things beyond their abilities.
In situations 10), 11), 13), and 16), it is unlikely that a player with low abilities would not seek help, and a player with high abilities would seek help.
To the best of our knowledge, this is the first application of Bayesian Nash equilibrium based on psychological game theory in studying human help-seeking and help-giving behavior. Through this study, we thus extend the generalizability of Bayesian Nash equilibrium based on psychological game theory to the study of human helping behavior.
Humans grow through mutual help, and society progresses accordingly. However, there are times when people are in deep trouble and are reluctant to ask for help; at other times, people are very hesitant to help others. By establishing a Bayesian Nash Equilibrium analysis, this study analyzes whether people would seek help or help others from two fundamental concepts related to internal rewards: self-awareness and politeness. We also demonstrate the extent to which self-awareness and politeness influence help-seeking and help-giving behaviors, which are regular and predictable. This study thus provides a theoretical understanding of the role of self-awareness and politeness in helping behavior.
For help-seeking behavior, we can understand why people do not seek help when they are clearly in trouble. Because people have the nature of politeness, it is difficult to ask for help if they are excessively polite and care about their image. Besides, people with an excessively high level of self-awareness often do not ask others for help because they are worried about exposing their flaws and incompetence in front of others [48].
From the perspective of helpers, we can also understand people tend to help others if they have a high level of self-awareness and politeness. However, it may not be their original intention. For one thing, helpers want to help others to create a positive personal impression and gain praise. For another, politeness, as a basic moral code, advocates the duty of helping others. It also motivates people to help those who are not life-threatening or in desperate need.
Many of our findings have practical implications for understanding and increasing helping behavior to build a harmonious and mutual aid society finally.
Based on this study, in the case of knowing the level of self-awareness and politeness of both parties, help seekers can judge whether the other party will help them, and thus decide whether to seek help. Helpers, on the other hand, can judge whether they help or not.
In terms of help-giving, after realizing that people with high levels of self-awareness tend to help, we can improve people's level of self-awareness to increase helping behavior. Specifically, we can encourage people to read, practice, reflect on themselves more, cultivate their independent awareness and thinking ability, and improve their self-awareness level. Besides, after realizing that people with high levels of politeness tend to help, we can promote the development of etiquette education and improve the level of etiquette cultivation ideologically, to improve the level of politeness. These measures can eventually increase the opportunity to give help. In brief, it is necessary to improve everyone's self-awareness and support and promote the moral code of being polite to others.
In terms of help-seeking, through this study, we found that individuals with a high level of self-awareness are often reluctant to seek help. So it is crucial to give the person being helped an opportunity to repay the favor. This has also been confirmed in other studies. People are more likely to commit to charities belonging to those who have given them favors [49]. This study suggests individuals with a high level of politeness tend to give up seeking help. Therefore, it is essential to eliminate the guilt of the seeker as much as possible and reduce the bad feeling.
There are many examples of helping behaviors in everyday life. For example, donation behavior is a typical helping behavior. For instance, in residential communities in China, when someone encounters difficulties such as sudden illness and needs to donate, there are often donation activities similar to love relays. These donation behaviors are influenced by two factors self-awareness and politeness in this study. In this context of donation behavior, people with a high level of self-awareness and politeness are more likely to donate to help those in need who are seriously ill but have no money for treatment. Patients who are short of money and unable to treat their illnesses may tend not to raise funds if their levels of self-awareness and politeness are too high, thus delaying treatment. In such a situation, on the one hand, we need to improve the level of self-awareness and politeness of as many people as possible in our society so that when someone needs help, as many people as possible will lend a helping hand. On the other hand, we can also build channels to provide opportunities for patients who seek help to thank donors so that patients who need help will not miss the opportunity to seek help for their own reasons.
Although there are extensive studies on human helping behavior in existing literature, prior research emphasized methods of psychological experiments. Besides, studies on human help-seeking and help-giving behaviors rarely study the connection of self-awareness and politeness to human help-seeking and help-giving behaviors, especially from the perspective of psychological game theory. This paper thus links two related social psychology concepts, self-awareness and politeness, with human helping behavior and applies Bayesian Nash equilibrium analysis to compare with the results obtained from psychological experiments in previous studies. We found that a helper with a high level of self-awareness and politeness would help. In contrast, help seekers with a high level of self-awareness and politeness would tend not to seek help. The results obtained in this study through the mathematical method of psychological game theory validate the conclusion of the influence of self-awareness and politeness on helping behavior in social psychology studies based on the research method of psychological experiments.
Limitations and future directions: To simplify the model, the study has limitations. First, this study does not consider the repaying, in other words, whether the help will be repaid in the future. Second, this study only considered two psychological factors, politeness and self-awareness; other psychological factors could also influence human helping behavior.
Future studies can consider the act of repaying, and the game theory model can be set as a repeated game. In addition, other psychological factors can be considered in the game theory model to make the theoretical model richer and more realistic to understand human help-seeking and help-giving behavior better.
We sincerely thank the editors and the anonymous reviewers for their thoughtful reviews and constructive suggestions during the review process. This work was supported by Jiangxi Culture, Art and Science Planning Grant Numbers YG2021184. We also wish to thank Otsuka Toshimi Scholarship Foundation for its generous help.
The authors declare no conflicts of interest in this paper.
[1] |
K. C. Valkenburg, A. E. de Groot, K. J. Pienta, Targeting the tumour stroma to improve cancer therapy, Nat. Rev. Clin. Oncol., 15 (2018), 366-381. doi: 10.1038/s41571-018-0007-1
![]() |
[2] |
N. Maishi, D. A. Annan, H. Kikuchi, Y. Hida, K. Hida, Tumor endothelial heterogeneity in cancer progression, Cancers, 11 (2019), 1511. doi: 10.3390/cancers11101511
![]() |
[3] |
S. M. Weis, D. A. Cheresh, Tumor angiogenesis: molecular pathways and therapeutic targets, Nat. Med., 17 (2011), 1359-1370. doi: 10.1038/nm.2537
![]() |
[4] |
D. Hanahan, R. A. Weinberg, Hallmarks of cancer: the next generation, Cell, 144 (2011), 646-674. doi: 10.1016/j.cell.2011.02.013
![]() |
[5] |
N. Maishi, K. Hida, Tumor endothelial cells accelerate tumor metastasis, Cancer Sci., 108 (2017), 1921-1926. doi: 10.1111/cas.13336
![]() |
[6] |
F. Bray, J. Ferlay, I. Soerjomataram, R. L. Siegel, L. A. Torre, A. Jemal, Global cancer statistics 2018: GLOBOCAN estimates of incidence and mortality worldwide for 36 cancers in 185 countries, CA: Cancer J. Clin., 68 (2018), 394-424. doi: 10.3322/caac.21492
![]() |
[7] | M. N. Uddin, M. Li, X. Wang, Identification of transcriptional signatures of colon tumor stroma by a meta-analysis, J. Oncol., 2019 (2019), 8752862. |
[8] | C. Isella, A. Terrasi, S. E. Bellomo, C. Petti, G. Galatola, A. Muratore, et al., Stromal contribution to the colorectal cancer transcriptome, Nat. Genet., 47 (2015), 312-319. |
[9] |
M. N. Uddin, M. Li, X. Wang, Identification of transcriptional markers and microRNA-mRNA regulatory networks in colon cancer by integrative analysis of mRNA and microRNA expression profiles in colon tumor stroma, Cells, 8 (2019), 1054. doi: 10.3390/cells8091054
![]() |
[10] | A. Calon, E. Lonardo, A. Berenguer-Llergo, E. Espinet, X. Hernando-Momblona, M. Iglesias, et al., Stromal gene expression defines poor-prognosis subtypes in colorectal cancer, Nat. Genet., 47 (2015), 320-329. |
[11] | L. Zuurbier, A. Rahman, M. Cordes, J. Scheick, T. J. Wong, F. Rustenburg, et al., Apelin: a putative novel predictive biomarker for bevacizumab response in colorectal cancer, Oncotarget, 8 (2017), 42949-42961. |
[12] | Z. Tang, C. Li, B. Kang, G. Gao, C. Li, Z. Zhang, GEPIA: a web server for cancer and normal gene expression profiling and interactive analyses, Nucleic Acids Res., 45 (2017), W98-W102. |
[13] | T. Li, J. Fan, B. Wang, N. Traugh, Q. Chen, J. S. Liu, et al., TIMER: a web server for comprehensive analysis of tumor-infiltrating immune cells, Cancer Res., 77 (2017), e108-e110. |
[14] | J. Xia, E. E. Gill, R. E. Hancock, NetworkAnalyst for statistical, visual and network-based meta-analysis of gene expression data, Nat. Protoc., 10 (2015), 823-844. |
[15] | A. Subramanian, P. Tamayo, V. K. Mootha, S. Mukherjee, B. L. Ebert, M. A. Gillette, et al., Gene set enrichment analysis: a knowledge-based approach for interpreting genome-wide expression profiles, P. Natl. Acad. Sci., 102 (2005), 15545-15550. |
[16] | M. Kanehisa, M. Furumichi, M. Tanabe, Y. Sato, K. Morishima, KEGG: new perspectives on genomes, pathways, diseases and drugs, Nucleic Acids Res., 45 (2017), D353-D361. |
[17] | D. Szklarczyk, A. L. Gable, D. Lyon, A. Junge, S. Wyder, J. Huerta-Cepas, et al., STRING v11: protein-protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets, Nucleic Acids Res., 47 (2019), D607-D613. |
[18] |
G. D. Bader, C. W. Hogue, An automated method for finding molecular complexes in large protein interaction networks, BMC Bioinf., 4 (2003), 1-27. doi: 10.1186/1471-2105-4-1
![]() |
[19] | K. Yoshihara, M. Shahmoradgoli, E. Martínez, R. Vegesna, H. Kim, W. Torres-Garcia, et al., Inferring tumour purity and stromal and immune cell admixture from expression data, Nat. Commun., 4 (2013), 1-11. |
[20] | H. Wickham, ggplot2: elegant graphics for data analysis, Media, 35(2009), 10-1007. |
[21] | J. H. Pan, H. Zhou, L. Cooper, J. L. Huang, S. B. Zhu, X. X. Zhao, et al., LAYN is a prognostic biomarker and correlated with immune infiltrates in gastric and colon cancers, Front. Immunol., 10 (2019), 6. |
[22] | P. Danaher, S. Warren, L. Dennis, L. Amico, A. White, et al., Gene expression markers of tumor infiltrating leukocytes, J. Immuno. Ther. Cancer, 5 (2017), 1-15. |
[23] | N. O. Siemers, J. L. Holloway, H. Chang, S. D. Chasalow, P. B. Ross-MacDonald, C. F. Voliva, et al., Genome-wide association analysis identifies genetic correlates of immune infiltrates in solid tumors, PloS One, 12 (2017), e0179726. |
[24] |
S. Sousa, J. Määttä, The role of tumour-associated macrophages in bone metastasis, J. Bone Oncol., 5 (2016), 135-138. doi: 10.1016/j.jbo.2016.03.004
![]() |
[25] |
M. N. Uddin, R. Akter, M. Li, Z. Abdelrahman, Expression of SARS-COV-2 cell receptor gene ACE2 is associated with immunosuppression and metabolic reprogramming in lung adenocarcinoma based on bioinformatics analyses of gene expression profiles, Chem.-Biol. Interact., 335 (2021), 109370. doi: 10.1016/j.cbi.2021.109370
![]() |
[26] | D. Drev, F. Harpain, A. Beer, A. Stift, E. S. Gruber, M. Klimpfinger, et al., Impact of fibroblast-derived SPARC on invasiveness of colorectal cancer cells, Cancers, 11 (2019), 1421. |
[27] |
S. Nallanthighal, J. P. Heiserman, D. J. Cheon, The role of the extracellular matrix in cancer stemness, Front. Cell Dev. Biol., 7 (2019), 86. doi: 10.3389/fcell.2019.00086
![]() |
[28] | Y. L. Hsu, Y. J. Chen, W. A. Chang, S. F. Jian, H. L. Fan, J. Y. Wang, et al., Interaction between tumor-associated dendritic cells and colon cancer cells contributes to tumor progression via CXCL1, Int. J. Mol. Sci., 19 (2018), 2427. |
[29] | J. H. Rho, J. J. Ladd, C. I. Li, J. D. Potter, Y. Zhang, D. Shelley, et al., Protein and glycomic plasma markers for early detection of adenoma and colon cancer, Gut, 67 (2018), 473-484. |
[30] |
K. Triff, K. Konganti, S. Gaddis, B. Zhou, I. Ivanov, R. S. Chapkin, Genome-wide analysis of the rat colon reveals proximal-distal differences in histone modifications and proto-oncogene expression, Physiol. Genomics, 45 (2013), 1229-1243. doi: 10.1152/physiolgenomics.00136.2013
![]() |
[31] | X. Cai, C. Liu, T. N. Zhang, Y. W. Zhu, X. Dong, P. Xue, Down-regulation of FN1 inhibits colorectal carcinogenesis by suppressing proliferation, migration and invasion, J. Cell. Biochem., 119 (2018), 4717-4728. |
[32] | Z. Dong, W. Lin, S. A. Kujawa, S. Wu, C. Wang, Predicting microRNA target genes and identifying hub genes in ⅡA stage colon cancer patients using bioinformatics analysis, Biomed Res. Int., 2019 (2019), 6341967. |
[33] | W. Yang, J. Ma, W. Zhou, Z. Li, X. Zhou, B. Cao, et al., Identification of hub genes and outcome in colon cancer based on bioinformatics analysis, Cancer Manage. Res., 11 (2019), 323-338. |
[34] | J. Wen, X. Min, M. Shen, Q. Hua, Y. Han, L. Zhao, et al., ACLY facilitates colon cancer cell metastasis by CTNNB1, J. Exp. Clin. Cancer Res., 38 (2019), 1-12. |
[35] | M. R. Akl, P. Nagpal, N. M. Ayoub, S. A. Prabhu, M. Gliksman, B. Tai, et al., Molecular and clinical profiles of syndecan-1 in solid and hematological cancer for prognosis and precision medicine, Oncotarget, 6 (2015), 28693-28715. |
[36] | F. Azimi, R. A. Scolyer, P. Rumcheva, M. Moncrieff, R. Murali, S. W. McCarthy, et al., Tumor-infiltrating lymphocyte grade is an independent predictor of sentinel lymph node status and survival in patients with cutaneous melanoma, J. Clin. Oncol., 30 (2012), 2678-2683. |
[37] |
S. Shalapour, M. Karin, Pas de Deux: control of anti-tumor immunity by cancer-associated inflammation, Immunity, 51 (2019), 15-26. doi: 10.1016/j.immuni.2019.06.021
![]() |
[38] |
A. Sawant, J. A. Hensel, D. Chanda, B. A. Harris, G. P. Siegal, A. Maheshwari, et al., Depletion of plasmacytoid dendritic cells inhibits tumor growth and prevents bone metastasis of breast cancer cells, J. Immunol., 189 (2012), 4258-4265. doi: 10.1186/1471-2105-12-1
![]() |
[39] | B. Li, C. N. Dewey, RSEM: accurate transcript quantification from RNA-Seq data with or without a reference genome, BMC Bioinf., 12 (2011), 1-16. |
[40] |
A. Facciabene, G. T. Motz, G. Coukos, T-regulatory cells: key players in tumor immune escape and angiogenesis, Cancer Res., 72 (2012), 2162-2171. doi: 10.1158/0008-5472.CAN-11-3687
![]() |
[41] | Y. H. Huang, C. Zhu, Y. Kondo, A. C. Anderson, A. Gandhi, A. Russell, et al., CEACAM1 regulates TIM-3-mediated tolerance and exhaustion, Nature, 517 (2015), 386-390. |
[42] | H. H. Lee, Y. N. Wang, W. Xia, C. H. Chen, K. M. Rau, L. Ye, et al., Removal of N-linked glycosylation enhances PD-L1 Detection and Predicts Anti-PD-1/PD-L1 therapeutic efficacy, Cancer Cell, 36 (2019), 168-178. |
[43] | J. H. Yearley, C. Gibson, N. Yu, C. Moon, E. Murphy, J. Juco, et al., PD-L2 expression in human tumors: relevance to anti-PD-1 therapy in cancer, Clin. Cancer Res., 23 (2017), 3158-3167. |
[44] |
J. Zavadil, E. P. Böttinger, TGF-beta and epithelial-to-mesenchymal transitions, Oncogene, 24 (2005), 5764-5774. doi: 10.1038/sj.onc.1208927
![]() |
[45] | D. Gu, S. Li, M. Du, C. Tang, H. Chu, N. Tong, et al., A genetic variant located in the miR-532-5p-binding site of TGFBR1 is associated with the colorectal cancer risk, J. Gastroenterol., 54 (2019), 141-148. |
[46] |
F. Wu, L. Liu, H. Zhou, Endothelial cell activation in central nervous system inflammation, J. Leukocyte Biol., 101 (2017), 1119-1132. doi: 10.1189/jlb.3RU0816-352RR
![]() |
[47] | C. Scimone, P. Bramanti, A. Ruggeri, L. Donato, C. Alafaci, C. Crisafulli, et al., CCM3/SERPINI1 bidirectional promoter variants in patients with cerebral cavernous malformations: a molecular and functional study, BMC Med. Genet., 17 (2016), 1-7. |
[48] | C. Scimone, F. Granata, M. Longo, E. Mormina, C. Turiaco, A. A. Caragliano, et al., Germline mutation enrichment in pathways controlling endothelial cell homeostasis in patients with brain arteriovenous malformation: implication for molecular diagnosis, Int. J. Mol. Sci., 21 (2020), 4321. |
[49] | C. Rinaldi, P. Bramanti, C. Scimone, L. Donato, C. Alafaci, et al., Relevance of CCM gene polymorphisms for clinical management of sporadic cerebral cavernous malformations, J. Neurol. Sci., 380 (2017), 31-37. |
[50] | C. Scimone, L. Donato, Z. Katsarou, S. Bostantjopoulou, R. Angelo, et al., Two novel krit1 and CCM2 mutations in patients affected by cerebral cavernous malformations: new information on CCM2 penetrance, Front. Neurol., 9 (2018), 953. |
[51] | C. Scimone, P. Bramanti, A. Ruggeri, Z. Katsarou, L. Donato, A. Sidoti, et al., Detection of novel mutation in ccm3 causes familial cerebral cavernous malformations, J. Mol. Neurosci., 57 (2015), 400-403. |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
1. | 琦 张, A Corpus-Based Study on the Application of Politeness Principle in Business English Letters, 2023, 11, 2330-1708, 4580, 10.12677/ML.2023.1110614 |