Next Article in Journal
Testing Game Theory of Mind Models for Artificial Intelligence
Previous Article in Journal
Collaborative Cost Multi-Agent Decision-Making Algorithm with Factored-Value Monte Carlo Tree Search and Max-Plus
Previous Article in Special Issue
Payment Systems, Supplier-Induced Demand, and Service Quality in Credence Goods: Results from a Laboratory Experiment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Cooperation and Coordination in Threshold Public Goods Games with Asymmetric Players

1
Laboratory of Mathematics and Complex Systems, Ministry of Education, School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China
2
School of Systems Science, Beijing Normal University, Beijing 100875, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Games 2023, 14(6), 76; https://doi.org/10.3390/g14060076
Submission received: 10 November 2023 / Revised: 5 December 2023 / Accepted: 13 December 2023 / Published: 17 December 2023
(This article belongs to the Special Issue Competition, Coordination, and Cooperation: Theory and Evidence)

Abstract

:
In this paper, we study cooperation and coordination in a threshold public goods game with asymmetric players where players have different endowments e i , productivities p i , and rewards r i . In general, this game has a defective Nash equilibrium (NE), in which no one contributes, and multiple cooperative NEs, in which the group’s collective contribution equals the threshold. We then study how multiple dimensions of inequality influence people’s cooperation and coordination. We show that heterogeneity in e i p i can promote cooperation in the sense that the existence condition of the defective NE becomes stricter. Furthermore, players with higher e i p i are likely to contribute more at a cooperative NE in terms of collective contribution (i.e., absolute contribution multiplied by productivity).

1. Introduction

Exploring cooperation and coordination stands out as a fundamental application of game theory. This field seeks to elucidate which mechanisms drive cooperative behavior and how individuals coordinate towards a more efficient equilibrium. Much of the existing work in this field considers homogeneous populations. However, inequality is ubiquitous in humans. Individuals often vary in their endowments, productivities, shares of rewards, and social hierarchy positions. Asymmetric games raise many exciting questions that are difficult to tackle within the standard setup of symmetric games. For example, what is the impact of various forms of inequality on cooperation and coordination? Does endowment inequality make cooperation and coordination more difficult than productivity inequality? How do individuals coordinate when they differ in multiple dimensions?
The existing literature suggests that the effect of inequality on cooperation is nontrivial. A considerable number of studies based on public goods games has found that endowment inequality tends to reduce cooperation [1,2,3] but that asymmetric productivities and the sharing of public goods tend to positively influence contributions or maintain a neutral impact [4,5,6,7]. In addition, in cases of both endowment and productivity heterogeneity, optimal cooperation is achieved when individuals with a higher productivity also possess greater endowments [8].
In contrast, the interaction between inequality and coordination has attracted less attention. In this paper, we discuss this issue within the framework of a simple coordination game, a threshold public goods game (TPGG). In a TPGG, individuals derive benefits from contributing to a public good only when their total collective contributions (i.e., absolute contribution multiplied by productivity) reach a certain threshold [9,10,11]. In general, a threshold public goods game tends to have many equilibria, including a defective equilibrium in which no contributions are made and a set of cooperative equilibria in which the group’s collective contribution exactly meets the threshold [9,11]. A cooperative equilibrium is more efficient than a defective equilibrium; therefore, everyone has the motivation to achieve the threshold. However, different players may prefer different cooperative equilibria. They may prefer other group members to contribute more, allowing them to contribute less, thereby leading to a nontrivial coordination problem.
When the TPGG is symmetric, i.e., all players have the same endowment, productivity, and share of the reward, a natural solution is that all the players contribute the same amount of their endowment to the public good. However, when the TPGG is asymmetric, experimental studies have demonstrated a negative effect of endowment inequality on coordination1: while rich subjects often make higher contributions compared to the symmetric case, the much less contributions from the poor lead to an overall decrease in the total collective contribution in the asymmetric scenario [11,12,13]. In contrast, it seems that productivity inequality does not have a significant effect [11]. The effect of inequality on cooperation and coordination has also been investigated in a variation of the TPGG, the climate game (also known as the collective-risk dilemma game) [14]. Experiments have found that achieving coordination is hindered more by endowment inequality than by productivity inequality [15,16,17,18]. Furthermore, the effects of multiple inequalities on coordination are generally more complex [19].
Most of the existing studies on asymmetric TPGGs have considered two types of players with only one source of asymmetry: they either differ in endowments or in productivities2. It is not clear how multiple dimensions of inequality influence people’s cooperation and coordination in large groups. In this paper, we consider an n -player asymmetric TPGG where players have different endowments, productivities, and rewards. We focus on the following two questions:
  • What is the impact of various forms of inequality on cooperation?
  • How do people coordinate when group members differ among multiple dimensions?
We investigate the impact of various forms of inequality on cooperation by examining the existence conditions of Nash equilibria. Furthermore, to analyze the coordination among players with multidimensional differences, we quantify the size of cooperative NE subset in which a specific player makes the largest relative, absolute, or collective contribution.
Section 2 provides a detailed description of the asymmetric TPGG model. In Section 3, two theorems are presented to address the two key questions. Section 4 conducts a numerical analysis, illustrating the theoretical findings with concrete examples. Conclusive remarks are given in Section 5.

2. Model

Let us consider a threshold public goods game (TPGG) with n asymmetric players. Each player i (with i = 1 , ,   n ) starts with some endowment, meaning e i > 0 . Then, each player independently decides which fraction x i of their endowment to contribute to the public good. Each player’s contribution is multiplied by a productivity factor p i . We refer to x i , e i x i , and e i p i x i as player i ’s relative contribution, absolute contribution, and collective contribution, respectively [11]. If the total collective contribution of the n players reaches a predefined threshold θ , then each player i obtains a reward r i along with their remaining endowment. Otherwise, the players only receive their remaining endowment. As a result, the players’ payoffs are as follows:
f i x = e i 1 x i + r i , i f   i = 1 n e i p i x i θ , e i 1 x i , i f   i = 1 n e i p i x i < θ .
This game can have various kinds of heterogeneities with respect to endowment e i , productivity p i , and reward r i . To compare the impact of various forms of inequality, we assume i = 1 n e i p i = G and i = 1 n r i = R , i.e., the maximum amount of group collective contribution and the total amount of reward are fixed. Furthermore, we assume r i e i for all i = 1 , 2 , , n , i.e., the social welfare is improved if the group reaches the threshold3.

3. Results

In general, an asymmetric TPGG has two types of NE. First, there is a set of cooperative NEs in which the total collective contribution exactly meets the threshold. In addition, there may exist a defective NE in which all the players choose not to contribute. Theorem 1 provides the existence conditions for the two types of NE (see Appendix A for the proof).
Theorem 1.
The defective NE, x   =   0 , exists if and only if, for any player i , (1) θ > e i p i or (2) θ = e i p i and r i = e i . In contrast, a cooperative NE (i.e., at least one player contributes to the public good) exists if and only if 0 < θ G . In addition, the set of cooperative NEs has the form x i = 1 n e i p i x i = θ .
Theorem 1 reveals the impact of various inequalities on cooperation from the perspective of NE. It indicates that individual differences have no effect on the existence of a cooperative NE. The cooperative NE set is not empty if and only if the maximum amount of group collective contribution is not less than the threshold. We then analyze the effect of heterogeneity on the defective NE by assuming r i > e i (i.e., the critical case r i = e i is excluded). For the symmetric case, the existence condition of the defective NE can be simplified as θ > G n . For the asymmetric case, the defective NE exists if and only if θ > e i p i for all players. Without a loss of generality, we consider that players differ in e i p i , with e 1 p 1 > e 2 p 2 > e n p n (i.e., player 1 is the most ‘able’ player). In this case, the defective NE exists if and only if θ > e 1 p 1 . Let us note that e 1 p 1 > i = 1 n e i p i n = G n , and the existence condition of the defective NE becomes stricter than that in the symmetric case. This implies that heterogeneity in e i p i has a positive impact on cooperation. In particular, defection ceases to be an NE when e 1 p 1 θ because, in this case, player 1 is motivated to contribute even if all the other players defect.
Theorem 1 also shows that, when 0 < θ < G , the game has an infinite number of cooperative NEs. In all these equilibria, the group collective contribution reaches the threshold (i.e., k = 1 n e k p k x k = θ ); yet, they vary in how the contributions are distributed among the players. We then analyze which player contributes more to a cooperative NE in the presence of asymmetries. We note that there are three measures of individual contribution, namely, relative contribution, absolute contribution, and collective contribution. We denote the subsets of the cooperative NE set where player i has the highest relative contribution, absolute contribution, and collective contribution by S i 1 , S i 2 , and S i 3 , respectively, and we denote their sizes (under the Hausdorff measure) by S i 1 , S i 2 , and S i 3 , respectively. Intuitively, S i k > S j k for all j i ( k = 1 , 2 , 3 ) means that player i is more likely to contribute most at a randomly chosen cooperative NE in terms of the relative, absolute, or collective contribution4. Theorem 2 compares the sizes of the different subsets (see Appendix B for the proof).
Theorem 2.
Let us suppose that  e 1 p 1 > e 2 p 2 > e n p n .
(1)
For relative contribution,  S 1 1 < < S n 1 if 0 < θ < e n p n ,  and  S 1 1 > > S n 1  if  i = 1 n 1 e i p i < θ < G .
(2)
For absolute contribution, when there is endowment heterogeneity, i.e.,  e 1 > > e n  and p 1 = = p n , S 1 2 S n 2  for all  0 < θ < G . When there is productivity heterogeneity, i.e.,  e 1 = = e n and p 1 > > p n , S 1 2 < < S n 2  if  0 < θ < e n p n ,  and  S 1 2 > > S n 2  if  i = 1 n 1 e i p i < θ < G .
(3)
For collective contribution,  S 1 3 S n 3  for all  0 < θ < G . Furthermore,  S 1 3 = = S n 3  if  0 < θ < e n p n .
Theorem 2 summarizes the contribution patterns in cooperative NEs when group members differ across multiple dimensions. First, ‘able’ players (i.e., players with larger e i p i ) are likely to make higher collective contributions in the sense that S i 3 S j 3 if e i p i > e j p j . In addition, if the threshold is sufficiently low such that any single player is able to achieve it, then all players are equally likely to make the highest collective contribution in a cooperative NE, irrespective of their abilities. Second, ‘able’ players are likely to have higher relative contributions only for large threshold, where successfully reaching the threshold requires the joint efforts of all players. However, for sufficiently low threshold, ‘able’ players tend to make smaller relative contributions. Finally, the results for absolute contribution depend on both e i and p i . When there is endowment inequality, the players with higher endowments are likely to contribute more for all thresholds. However, when there is productivity inequality, the more productive players are likely to contribute more only for large threshold.

4. Numerical Analysis

Theorems 1 and 2 qualitatively analyze the effect of various forms of inequality on cooperation and coordination. In particular, Theorem 2 compares the relative sizes of S i k for low thresholds (i.e., 0 < θ < e n p n ) and high thresholds (i.e., i = 1 n 1 e i p i < θ < G ). In order to enhance the comprehension of the two theorems, we calculate the Nash equilibria and absolute sizes of the three types of subsets S i 1 , S i 2 , and S i 3 for two-player threshold public goods games with all 0 < θ < G . Inspired by [8], we consider five scenarios, namely, full equality, endowment inequality, productivity inequality, aligned inequality, and misaligned inequality. Full equality corresponds to a homogeneous scenario, whereas in the endowment inequality and productivity inequality scenarios players only differ in a single dimension. In the last two scenarios, players differ in two dimensions: in the aligned inequality scenario, both advantages concentrate in one player, with the high-endowment player being more productive, while in the misaligned inequality scenario these two advantages distribute across two players, meaning the high-endowment player is less productive. Furthermore, e 1 p 1 = e 2 p 2 = 30 in the full equality and misaligned inequality scenarios; e 1 p 1 = 40 , e 2 p 2 = 20 in the endowment inequality and productivity inequality scenarios, and e 1 p 1 = 48 , e 2 p 2 = 12 in the aligned inequality scenario. Detailed parameter settings for e i and p j can be found in the first column of Table 1 ( G = 60 and r 1 = r 2 = 45 in all five scenarios). For each scenario, the threshold θ is categorized into three ranges according to Theorem 2, i.e., low thresholds 0 < θ < e 2 p 2 , intermediate thresholds e 2 p 2 θ e 1 p 1 , and high thresholds e 1 p 1 < θ < G .
We first study the effect of inequality on cooperation. Theorem 1 says that heterogeneity in e i p i can promote cooperation in the sense that the existence condition of the defective NE becomes stricter. From Table 1, the existence conditions of the defective NE in the full equality, endowment inequality, productivity inequality, aligned inequality, and misaligned inequality scenarios are θ > 30 , θ > 40 , θ > 40 , θ > 48 , and θ > 30 , respectively. This shows clearly that the existence condition of the defective NE is harder to satisfy when heterogeneity in e i p i increases.
We then analyze the set of cooperative NEs. Figure 1 shows the set of cooperative NEs for different game scenarios and thresholds θ . For a two-player threshold public goods game, the set of cooperative NEs is a line segment in the x 1 - x 2 plane with slope e 1 p 1 e 2 p 2 . Furthermore, the length of the line segment (which measures the size of the cooperative NE set) does not change monotonically in the threshold: it first increases and then decreases as θ increases from 0 to G .
Columns 4–6 in Table 1 show the (absolute) sizes of the three sets S i 1 , S i 2 , and S i 3 for different game scenarios and ranges of θ . Overall, the difference between the sizes of the two cooperative NEs sets, S 1 k S 2 k , expands as θ increases for all   k = 1 ,   2 ,   3 . In other words, higher thresholds result in an increased probability that the more ‘able’ player makes a greater contribution at a randomly chosen cooperative NE. However, the size relationship between S 1 k and S 2 k depends crucially on e i , p i , θ , and the contribution type.
For relative contribution, as pointed out in Theorem 2(1), in game scenarios with heterogeneity in e i p i (i.e., the endowment inequality, productivity inequality, and aligned inequality scenarios), the size of S 1 1 is less than S 2 1 for low thresholds 0 < θ < e 2 p 2 , whereas the opposite is true for high threshold e 1 p 1 < θ < G . In addition, for intermediate thresholds e 2 p 2 θ e 1 p 1 , the size of S 1 1 (or S 2 1 ) is increasing (or decreasing) in θ . In contrast, in game scenarios without heterogeneity in e i p i (i.e., the full equality and misaligned inequality scenarios), S 1 1 = S 2 1 for all θ . For collective contribution, Theorem 2(3) predicts S 1 3 = S 2 3 for low thresholds 0 < θ < e 2 p 2 . This is indeed the case. Furthermore, we observe S 1 3 > S 2 3 for the intermediate and high thresholds e 2 p 2 < θ < G in the three game scenarios with heterogeneity in e i p i . This observation is slightly stronger than the prediction of Theorem 2(3) (which says that S 1 3 S 2 3 ). Finally, the numerical analysis confirms that the results for the absolute contribution are sensitive to e i and p i . In particular, S 1 2 = S 2 2 in the full equality scenario; S 1 2 S 2 2 for all θ in the endowment inequality and misaligned inequality scenarios, and S 1 2 < S 2 2 for low thresholds and S 1 2 > S 2 2 for high thresholds in the productivity inequality and aligned inequality scenarios.

5. Concluding Remarks

In this paper, we consider an n -player asymmetric TPGG, where players have different endowments, productivities, and rewards. This game can have a defective NE and multiple cooperative NEs. We show that heterogeneity in e i p i can promote cooperation in the sense that the existence condition of the defective NE becomes stricter. Furthermore, players with higher e i p i are likely to contribute more at a cooperative NE in terms of collective contribution, but they do not necessarily have a higher relative contribution or absolute contribution. This result is consistent with a recent experimental study on a two-player asymmetric TPGG [11]. In the study [11], subjects either differ in their endowments or in their productivities. In most of the successful groups (i.e., the group has reached the threshold), the collective contribution of the rich individual or the more productive individual is higher, but the two group members tend to have similar relative contributions in the endowment inequality scenario, while having similar absolute contributions in the productivity inequality scenario. In sum, our study highlights the nontrivial effects of inequality on cooperation and coordination in a TPGG.
To deepen our understanding on human behaviors in TPGGs, a possible direction for future research is to empirically validate the theoretical findings for scenarios where players differ in two or more dimensions (e.g., the aligned and misaligned inequality scenarios discussed in Section 4). Another direction for a future investigation could focus on the coordination problem in an asymmetric climate game. A recent study showed that cooperation can be an equilibrium outcome if and only if the weighted average of climate risk of all countries reaches or exceeds the coefficient of emission reduction target [20]. However, the climate game can have multiple cooperative equilibria, in which countries have different responsibilities for carbon emission reduction at different equilibria. Thus, a natural question would be the following: how do countries with different endowments, climate risks, and emission reduction costs coordinate? Finally, the reward value for each player in our model is considered to be fixed. It would be interesting to investigate the TPGG model within a cooperative game framework, where rewards are assigned, according to the players’ values, to each coalition. Specifically, one could calculate the stable reward allocation schemes in asymmetric TPGGs based on the Shapley value, CIS value, and nucleolus and compare the fairness and efficiency of these allocation schemes.

Author Contributions

All authors share first authorship and are sorted alphabetically. Conceptualization, Y.D. and B.Z.; methodology, all authors; validation, B.Z.; formal analysis, X.A., X.W. and B.Z.; investigation, all authors; resources, Y.D. and B.Z.; writing—original draft preparation, all authors; writing—review and editing, B.Z.; visualization, X.W.; supervision, Y.D. and B.Z.; project administration, B.Z.; funding acquisition, Y.D. and B.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Science Foundation of China (Grants Number 72131003, 72103021, and 72091511) and the Beijing Natural Science Foundation (Grant Number Z220001). Xiaomin Wang acknowledges financial support from the China Scholarship Council for a 14-month study at the Max Planck Institute for Evolutionary Biology.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Proof of Theorem 1

Proof. 
(i) 
Existence conditions of a defective Nash equilibrium
If x = 0 is a Nash equilibrium, then no player has an incentive to contribute when others do not. Therefore, for any player   i with strategy 0 < x i 1 ,
e i e i 1 x i + r i , if   e i p i x i θ ,   e i e i 1 x i , if   e i p i x i < θ .
According to the assumption of r i e i , it follows that, for any player i , (1) θ > e i p i or (2) θ = e i p i and e i = r i .
Intuitively, condition (1) implies that the group cannot reach the threshold when only one player contributes. Condition (2) implies that, although the threshold can be reached if player i contributes all of his or her endowment, there is no payoff improvement for player i .
(ii) 
Cooperative Nash equilibria set and its existence condition
Let us suppose that the strategy profile x satisfies i = 1 n e i p i x i > 0 . On the one hand, if i = 1 n e i p i x i = θ , then it is easy to check that no player has an incentive to increase or decrease his or her contribution under the assumption of r i e i . On the other hand, if i = 1 n e i p i x i > θ or 0 < i = 1 n e i p i x i < θ , then at least one player can obtain a higher payoff by reducing his or her contribution. Therefore, the set of cooperative NEs is x i = 1 n e i p i x i = θ . In addition, the cooperative NE set is empty if and only if θ > G (i.e., the group cannot reach the threshold even if all the players contribute all of their endowments). Thus, a cooperative NE exists if and only if 0 < θ G . □

Appendix B. Proof of Theorem 2

Proof Outline. Theorem 2 includes three parts of results, namely, results for (1) the relative contribution, (2) the absolute contribution, and (3) the collective contribution. We begin by proving part (3) and then establish part (1) based on the approach developed in part (3). Finally, part (2) can be directly obtained from part (1) and part (3).
To prove part (3), it is enough to compare the measures of two consecutive sets, S i 3   and   S i + 1 3 . We transform the set S i 3 to a new set W i through an affine transformation and show W i | W i + 1 | for all 0 < θ < G and i = 1 , , n 1 . This then implies that S 1 3 S n 3 .
For part (1), when i = 1 n 1 e i p i < θ < G , each set S i 1 can be regarded as an ( n 1 )-dimensional polytope. Thus, the comparison between S i 1   and   S i + 1 1 can be made by directly calculating the volume of these polytopes. When 0 < θ < e n p n , we apply the approach developed in part (3) to compare S i 1   and   S i + 1 1 . Specifically, we represent S i 1 as   j = 1 n S i 1 S j 3 , and, therefore, S i 1 = j = 1 n S i 1 S j 3 . It is easy to check that S i 1 S j 3 = for i < j . Hence, to establish S i 1 < S i + 1 1 , we only need to prove the following two lemmas (refer to Figure A1).
Lemma 1.
When 0 < θ < e n p n , S i 1 S j 3 < S i + 1 1 S j 3  for  i > j .
Lemma 2.
When  0 < θ < e n p n , S i 1 S i 3 < S i + 1 1 S i + 1 3  for  i = 1 , , n 1 .
Figure A1. Comparison between S i 1 and S i + 1 1 when 0 < θ < e n p n .
Figure A1. Comparison between S i 1 and S i + 1 1 when 0 < θ < e n p n .
Games 14 00076 g0a1
Proof of part (3). The set S i 3 is defined as
S i 3 = x 1 , x 2 , , x n k = 1 n e k p k x k = θ ,     max k e k p k x k = e i p i x i ,   x k 0 , 1 , k { 1 , 2 , , n }   .
Applying the following affine transformation F :   R n R n to set S i 3 yields a new set W i , as follows:
x 1 x 2 x n e 1 p 1 0 0 e 2 p 2   0   0   0   0 e n p n x 1 x 2 x n A x 1 x 2 x n .
Their measures satisfy S i 3 = | W i | A , where A > 0 is the Jacobian determinant. The set W i is expressed as
W i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i p i x i ,       0 e k p k x k e k p k ,   k i , 0   e i + 1 p i + 1 x i + 1 e i p i x i e i p i .
Similarly, applying the same transformation to S i + 1 3 yields W i + 1 , which is expressed as
W i + 1 = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i + 1 p i + 1 x i + 1 ,       0 e k p k x k e k p k ,   k i , i + 1 , 0   e i p i x i e i + 1 p i + 1 x i + 1 e i + 1 p i + 1 .
Given that e 1 p 1 > e 2 p 2 > > e n p n , the set W i can be partitioned into W i and W i , where W i is expressed as
W i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i p i x i ,       0 e k p k x k e k p k ,   k i , i + 1 , 0   e i + 1 p i + 1 x i + 1 e i p i x i e i + 1 p i + 1 ,
and W i is expressed as
W i = W i \ W i .
Thus, W i = W i + W i . Due to the symmetry of e i p i x i and e i + 1 p i + 1 x i + 1 , we deduce that W i = | W i + 1 | . Consequently, W i W i + 1 , and, therefore, S i 3 S i + 1 3 .
Furthermore, when 0 < θ < e n p n , the set S i 3 can be written as
S i 3 = x 1 , x 2 , , x n k = 1 n e k p k x k = θ ,     x k 0 ,   θ e k p k ,   max k e k p k x k = e i p i x i .
Correspondingly, the set W i is expressed as
W i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,     e k p k x k 0 ,   θ ,   max k e k p k x k = e i p i x i .
Due to the symmetry of e i p i x i and e i + 1 p i + 1 x i + 1 , it is obvious that W i = W i + 1 , and, therefore, S i 3 = S i + 1 3 .
Proof of part (1). The set S i 1 is defined as
S i 1 = x 1 , x 2 , , x n k = 1 n e k p k x k = θ ,     x k 0 , 1 , k 1 , 2 , , n ,   max k x k = x i .
(i) 
When i = 1 n 1 e i p i < θ < G , each S i 1 is an ( n 1 )-dimensional convex polytope formed by n vertices. Specifically, we define the following:
α 1 = θ     k 1 n e k p k   e 1 p 1 , 1 , 1 , , 1 ; α 2 = 1 , θ     k 2 n e k p k   e 2 p 2 , 1 , , 1 ;   α n = 1 , 1 , 1 , , θ     k n n e k p k   e n p n ; and   O = θ G , θ G , , θ G .
The vertex set of the convex polytope S i 1 is written as { O , α 1 , , α i 1 , α i + 1 , , α n } . Thus, the volume of S i 1 (in terms of the Hausdorff measure) can be obtained by calculating the magnitude of a cross product
ω = v 1 v 2 v i 1 v i v i + 1 v n a 1 a a a a a a a 2 a a a a a a a i 1 a a a a a a a a i + 1 a a a a a a a n ,
where v i is the unit vector, and
a = 1 θ G ; a 1 = θ     k 1 n e k p k   e 1 p 1 θ G ; a 2 = θ     k 2 n e k p k   e 2 p 2 θ G ; a n = θ     k n n e k p k   e n p n θ G .
The magnitude of ω , which equals the measure of S i 1 , is then given by
| ω | = k = 1 n e k p k 2   G θ n 1 G · i = 1 n e k p k e i p i .
Since e 1 p 1 > e 2 p 2 > > e n p n , it implies that S i 1 > S i + 1 1 for all i 1 , 2 , , n 1 .
(ii) 
When 0 < θ < e n p n , we represent S i 1 as   j = 1 n S i 1 S j 3 and focus on the set S i 1 S j 3 . This set can be expressed as
S i 1 S j 3 = x 1 , x 2 , , x n k = 1 n e k p k x k = θ ,     x k 0 , 1 , k 1 , 2 , , n , max k e k p k x k = e j p j x j ,   max k x k = x i .
In the following, we prove the two lemmas mentioned in the proof outline.
Proof of Lemma 1.
Applying the affine transformation F (this transformation is introduced in the proof of part (3)) to the set S i 1 S j 3 yields a new set V i , j ,
V i , j = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,     e k p k x k 0 , e k p k , k 1 , 2 , , n , max k e k p k x k = e j p j x j , max k x k = x i .
First, we claim that | V i , j | > 0   for i > j under the condition 0 < θ < e n p n . To demonstrate this, we prove that the interior of V i , j is nonempty. Given 0 < θ < e n p n and i > j , we can find q ^ = ( q ^ 1 , q ^ 2 , , q ^ n ) V i , j such that max k j q ^ k < q ^ j and max k i q ^ k e k p k < q ^ i e i p i . For every g = ( g 1 , g 2 , , g n ) close to q ^ , it can be written as ε q + ( 1 ε ) q ^ for small ε . Specifically, we can choose q from the compact set
C = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ , e k p k x k 0 , e k p k ,   e s p s x s = 0   f o r   s o m e   s s u p p q ^ ,
which consists of the faces which do not contain q ^ . It is evident that g V i , j for a sufficiently small ε . Hence, for every q C ,   g = ε q + ( 1 ε ) q ^ V i , j for all ε < ε ¯ ( q ) . It is easy to see that ε ¯ ( q ) can be chosen as continuous. Let ε ¯ m i n { ε ¯ q :   q C } , which is strictly positive. Therefore, the neighborhood of q ^ , denoted as { g | g = ε q + 1 ε q ^ , q C   a n d   ε < ε ¯ } , is contained within the set V i , j . Consequently, V i , j > 0 for i > j .
Next, we rewrite the sets V i + 1 , j and V i , j as follows:
V i + 1 , j = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   e k p k x k 0 , e k p k , k 1 , 2 , , n ,   max k e k p k x k = e j p j x j , m a x k i + 1 { e i + 1 p i + 1 x k } e i + 1 p i + 1 x i + 1 e j p j x j ,
and
V i , j = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   e k p k x k 0 , e k p k , k 1 , 2 , , n ,   max k e k p k x k = e j p j x j ,   m a x k i { e i p i x k } e i p i x i e j p j x j .
Partition the set V i + 1 , j into V i + 1 , j and V i + 1 , j , where
V i + 1 , j = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ , e k p k x k 0 , e k p k , k 1 , 2 , , n , max k e k p k x k = e j p j x j , m a x k i + 1 { e i + 1 p i + 1 x k } e i + 1 p i + 1 x i + 1 < e i p i max max k i , i + 1 x k , e i p i x i e i + 1 p i + 1 ,
and
V i + 1 , j = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   e k p k x k 0 , e k p k , k 1 , 2 , , n , max k e k p k x k = e j p j x j ,   e i p i max max k i , i + 1 x k , e i p i x i e i + 1 p i + 1 e i + 1 p i + 1 x i + 1 e j p j x j .
Following this, V i + 1 , j = V i + 1 , j + V i + 1 , j . Due to the symmetry of e i p i x i and e i + 1 p i + 1 x i + 1 , we can deduce that V i , j = | V i + 1 , j | for i > j . Considering that m a x k i + 1 { e i + 1 p i + 1 x k } < e i p i max max k i , i + 1 x k , e i p i x i e i + 1 p i + 1 , it follows that V i + 1 , j > 0 . Therefore, V i , j < V i + 1 , j , and, thus, S i 1 S j 3 < S i + 1 1 S j 3 for i > j .
Proof of Lemma 2.
In the first step, we prove that S m 1 S i 3 > S m 1 S i + 1 3 for m > i + 1 and 0 < θ < e n p n . Let us consider the set V m , i , which is obtained by applying the affine transformation F to set S m 1 S i 3 .
V m , i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,     e k p k x k 0 , e k p k , k 1 , 2 , , n ,   max k e k p k x k = e i p i x i ,   max k x k = x m .
When 0 < θ < e n p n , from Lemma 1, we have | V m , i + 1 | > 0 and V m , i > 0 for m > i + 1 .
We rewrite the set V m , i + 1 and V m , i as
V m , i + 1 = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i + 1 p i + 1 x i + 1 ,     k i , i + 1 ,   0 e k p k x k e k p k x m , 0 e i p i x i e i + 1 p i + 1 x i + 1 e i + 1 p i + 1 x m ,
and
V m , i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i p i x i ,     k i ,   0 e k p k x k e k p k x m , 0 e i + 1 p i + 1 x i + 1 e i p i x i e i p i x m ,
and then partition the set V m , i into V m , i and V m , i , where
V m , i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i p i x i ,     k i , i + 1 ,   0 e k p k x k e k p k x m ,   0 e i + 1 p i + 1 x i + 1 e i p i x i e i + 1 p i + 1 x m   ,
and
V m , i = e 1 p 1 x 1 , e 2 p 2 x 2 , , e n p n x n k = 1 n e k p k x k = θ ,   max k e k p k x k = e i p i x i ,     k i ,   0 e k p k x k e k p k x m ,   e i + 1 p i + 1 x m < e i p i x i e i p i x m   .
Hence, V m , i = V m , i + V m , i . Due to the symmetry of e i p i x i and e i + 1 p i + 1 x i + 1 , V m , i + 1 = | V m , i | . Since e i p i x m > e i + 1 p i + 1 x m , V m , i > 0 . Therefore, V m , i > V m , i + 1 , and, thus, S m 1 S i 3 > S m 1 S i + 1 3 for m > i + 1 .
In the second step, we prove S i 1 S i 3 < S i + 1 1 S i + 1 3 . From part (3), S 1 3 = = S n 3 when 0 < θ < e n p n . We note that the following equations hold:
S i + 1 3 = j = 1 n S j 1 S i + 1 3 ;
S i 3 = j = 1 n S j 1 S i 3 ;
and ( S j 1 S i 3 ) ( S k 1 S i 3 ) = 0   f o r   a l l   j k . Given S m 1 S i 3 > S m 1 S i + 1 3   f o r   m > i + 1 and S i 1 S j 3 = for i < j , we deduce that S i 1 S i 3 + S i + 1 1 S i 3 < S i + 1 1 S i + 1 3 (refer to Figure A2). Consequently, S i 1 S i 3 < S i + 1 1 S i + 1 3 . □
Figure A2. Comparison between S i 1 S i 3 and S i + 1 1 S i + 1 3 when 0 < θ < e n p n .
Figure A2. Comparison between S i 1 S i 3 and S i + 1 1 S i + 1 3 when 0 < θ < e n p n .
Games 14 00076 g0a2

Notes

1
Dragicevic [10] theoretically studied a TPGG in the context of the option fund market and found that payoff inequality between buyers and sellers can undermine coordination efforts.
2
Dong et al. [19] considered a climate game with two types of players, in which rich (or poor) players have higher (or lower) endowment and emission reduction cost (i.e., low productivity). Their theoretical analysis and behavioral experiment based on specific parameters showed that the effect of multiple inequalities on coordination is generally more complex. More general discussion on NE in a climate game with heterogeneous players can be found in [19].
3
We note that at an NE, the absolute contribution of player i cannot exceed r i even if r i < e i . Otherwise, this player can obtain a higher payoff by deviating to free-riding. Thus, this assumption does not affect the equilibrium structure of the game.
4
An alternative scenario is one in which players choose their strategies from a finite grid { 0 , 1 m , , 1 } with sufficiently large m . In this case, the cooperative NE set consists of finite number of equilibria, and S i k > S j k for all j i ( k = 1 , 2 , 3 ) implies that there are more equilibria in which player i contributes the most.

References

  1. Cherry, T.L.; Kroll, S.; Shogren, J.F. The impact of endowment heterogeneity and origin on public good contributions: Evidence from the lab. J. Econ. Behav. Organ. 2005, 57, 357–365. [Google Scholar] [CrossRef]
  2. Heap, S.P.H.; Ramalingam, A.; Stoddard, B.V. Endowment inequality in public goods games: A re-examination. Econ. Lett. 2016, 146, 4–7. [Google Scholar] [CrossRef]
  3. Martinangeli, A.F.M.; Martinsson, P. We, the rich: Inequality, identity and cooperation. J. Econ. Behav. Organ. 2020, 178, 249–266. [Google Scholar] [CrossRef]
  4. Fisher, J.; Isaac, R.M.; Schatzberg, J.W.; Walker, J.M. Heterogenous demand for public goods: Behavior in the voluntary contributions mechanism. Public Choice 1995, 85, 249–266. [Google Scholar] [CrossRef]
  5. McGinty, M.; Milam, G. Public goods provision by asymmetric agents: Experimental evidence. Soc. Choice Welf. 2013, 40, 1159–1177. [Google Scholar] [CrossRef]
  6. Reuben, E.; Riedl, A. Enforcement of contribution norms in public good games with heterogeneous populations. Games Econ. Behav. 2013, 77, 122–137. [Google Scholar] [CrossRef]
  7. Kölle, F. Heterogeneity and cooperation: The role of capability and valuation on public goods provision. J. Econ. Behav. Organ. 2015, 109, 120–134. [Google Scholar] [CrossRef] [PubMed]
  8. Hauser, O.P.; Hilbe, C.; Chatterjee, K.; Nowak, M.A. Social dilemmas among unequals. Nature 2019, 572, 524–527. [Google Scholar] [CrossRef] [PubMed]
  9. Palfrey, T.; Rosenthal, H. Participation and the provision of discrete public goods: A strategic analysis. J. Public Econ. 1984, 24, 171–193. [Google Scholar] [CrossRef]
  10. Dragicevic, A.Z. Option fund market dynamics for threshold public goods. Dyn. Games Appl. 2017, 7, 21–33. [Google Scholar] [CrossRef]
  11. Wang, X.; Couto, M.C.; Wang, N.; An, X.; Chen, B.; Dong, Y.; Hilbe, C.; Zhang, B. Cooperation and coordination in heterogeneous populations. Philos. Trans. R. Soc. B 2023, 378, 20210504. [Google Scholar] [CrossRef] [PubMed]
  12. Rapoport, A.; Suleiman, R. Incremental contribution in step-level public goods games with asymmetric players. Organ. Behav. Hum. Decis. Process. 1993, 55, 171–194. [Google Scholar] [CrossRef]
  13. Alberti, F.; Cartwright, E.J. Full agreement and the provision of threshold public goods. Public Choice 2016, 166, 205–233. [Google Scholar] [CrossRef]
  14. Milinski, M.; Sommerfeld, R.D.; Krambeck, H.J.; Reed, F.A.; Marotzke, J. The collective-risk social dilemma and the prevention of simulated dangerous climate change. Proc. Natl. Acad. Sci. USA 2008, 105, 2291–2294. [Google Scholar] [CrossRef] [PubMed]
  15. Milinski, M.; Röhl, T.; Marotzke, J. Cooperative interaction of rich and poor can be catalysed by intermediate climate targets. Clim. Change 2011, 109, 807–814. [Google Scholar] [CrossRef]
  16. Tavoni, A.; Dannenberg, A.; Kallis, G.; Löschel, A. Inequality, communication, and the avoidance of disastrous climate change in a public goods game. Proc. Natl. Acad. Sci. USA 2011, 108, 11825–11829. [Google Scholar] [CrossRef] [PubMed]
  17. Feige, C.; Ehrhart, K.M.; Krämer, J. Climate negotiations in the lab: A threshold public goods game with heterogeneous contributions costs and non-binding voting. Environ. Resour. Econ. 2018, 70, 343–362. [Google Scholar] [CrossRef]
  18. Kline, R.; Seltzer, N.; Lukinova, E.; Bynum, A. Differentiated responsibilities and prosocial behavior in climate change mitigation. Nat. Hum. Behav. 2018, 2, 653–661. [Google Scholar] [CrossRef] [PubMed]
  19. Dong, Y.; Ma, S.; Zhang, B.; Wang, W.X.; Pacheco, J.M. Financial incentives to poor countries promote net emissions reductions in multilateral climate agreements. One Earth 2021, 4, 1141–1149. [Google Scholar] [CrossRef]
  20. Huang, Y.; Wang, X.; Zhang, B.; Dong, Y. Global emission reduction problem with heterogenous agents. J. Beijing Norm. Univ. Nat. Sci. 2023, 59, 806–811. [Google Scholar] [CrossRef]
Figure 1. Nash equilibria for different game scenarios and thresholds θ . Utilizing parameters from Table 1, we set (a) θ = 10 in the low θ panel, (b) θ = 30 in the intermediate θ panel, and (c) θ = 50 in the high θ panel for all five game scenarios. The colored segments denote the sets of cooperative NEs, and the colored filled points denote the defective NE. Squares, diamonds, and circles, respectively, denote the points of equal relative contributions, equal absolute contributions, and equal collective contributions in the cooperative NE set. Thus, these points are the segmentation points of sets S 1 k (below the point) and S 2 k (above the point) for k = 1 , 2 , 3 . When multiple points overlap, they are adjusted horizontally to be better differentiated. The grey area indicates that the threshold is reached.
Figure 1. Nash equilibria for different game scenarios and thresholds θ . Utilizing parameters from Table 1, we set (a) θ = 10 in the low θ panel, (b) θ = 30 in the intermediate θ panel, and (c) θ = 50 in the high θ panel for all five game scenarios. The colored segments denote the sets of cooperative NEs, and the colored filled points denote the defective NE. Squares, diamonds, and circles, respectively, denote the points of equal relative contributions, equal absolute contributions, and equal collective contributions in the cooperative NE set. Thus, these points are the segmentation points of sets S 1 k (below the point) and S 2 k (above the point) for k = 1 , 2 , 3 . When multiple points overlap, they are adjusted horizontally to be better differentiated. The grey area indicates that the threshold is reached.
Games 14 00076 g001
Table 1. Nash equilibria and sizes of S i k in two-player threshold public goods games. Column 1: Five game scenarios are considered, namely, full equality, endowment inequality, productivity inequality, aligned inequality, and misaligned inequality. Column 2: For each scenario, the threshold θ is categorized into three ranges according to Theorem 2. Column 3: The cooperative NE set is non-empty for all parameter combinations, and the defective NE exists only for high thresholds. Columns 4–6: Absolute sizes of the three sets S i 1 , S i 2 , and S i 3 . The size relationship between S 1 k and S 2 k is marked using different colors. Red:  S 1 k > S 2 k . Black: S 1 k = S 2 k . Blue:  S 1 k < S 2 k . Grey: the relationship between S 1 k and S 2 k depends on θ . Three cells are highlighted. In these cells, S 1 3 > S 2 3 for almost all θ . The exceptions are θ = 20 in the first two cells and θ = 12 in the last cell.
Table 1. Nash equilibria and sizes of S i k in two-player threshold public goods games. Column 1: Five game scenarios are considered, namely, full equality, endowment inequality, productivity inequality, aligned inequality, and misaligned inequality. Column 2: For each scenario, the threshold θ is categorized into three ranges according to Theorem 2. Column 3: The cooperative NE set is non-empty for all parameter combinations, and the defective NE exists only for high thresholds. Columns 4–6: Absolute sizes of the three sets S i 1 , S i 2 , and S i 3 . The size relationship between S 1 k and S 2 k is marked using different colors. Red:  S 1 k > S 2 k . Black: S 1 k = S 2 k . Blue:  S 1 k < S 2 k . Grey: the relationship between S 1 k and S 2 k depends on θ . Three cells are highlighted. In these cells, S 1 3 > S 2 3 for almost all θ . The exceptions are θ = 20 in the first two cells and θ = 12 in the last cell.
( e 1 , e 2 , p 1 , p 2 ) ThresholdNE ( | S 1 1 | , | S 2 1 | ) ( | S 1 2 | , | S 2 2 | ) ( | S 1 3 | , | S 2 3 | )
Full equality
( 30 , 30 , 1 , 1 )
0 < θ < 30 x 1 + x 2 = θ 30 2 θ 60 ,   2 θ 60 2 θ 60 ,   2 θ 60 2 θ 60 ,   2 θ 60
θ = 30 x 1 + x 2 = 1 2 2 ,   2 2 2 2 ,   2 2 2 2 ,   2 2
30 < θ < 60 x 1 + x 2 = θ 30 ;
x 1 = x 2 = 0
2 2 θ 60 ,   2 2 θ 60 2 2 θ 60 ,   2 2 θ 60 2 2 θ 60 ,   2 2 θ 60
Endowment
inequality
( 40 , 20 , 1 , 1 )
0 < θ < 20 2 x 1 + x 2 = θ 20 5 θ 120 ,   5 θ 60 5 θ 80 ,   5 θ 80 5 θ 80 ,   5 θ 80
20 θ 40 2 x 1 + x 2 = θ 20 5 θ 120 ,   5 2 5 θ 120 5 θ 80 ,   5 2 5 θ 80 5 θ 80 ,   5 2 5 θ 80
40 < θ < 60 2 x 1 + x 2 = θ 20 ;
x 1 = x 2 = 0
5 5 θ 60 ,   5 2 5 θ 120 3 5 2 5 θ 40 ,   0 3 5 2 5 θ 40 ,   0
Productivity
inequality
( 20 , 20 , 2 , 1 )
0 < θ < 20 2 x 1 + x 2 = θ 20 5 θ 120 ,   5 θ 60 5 θ 120 ,   5 θ 60 5 θ 80 ,   5 θ 80
20 θ 40 2 x 1 + x 2 = θ 20 5 θ 120 ,   5 2 5 θ 120 5 θ 120 ,   5 2 5 θ 120 5 θ 80 ,   5 2 5 θ 80
40 < θ < 60 2 x 1 + x 2 = θ 20 ;
x 1 = x 2 = 0
5 5 θ 60 ,   5 2 5 θ 120 5 5 θ 60 ,   5 2 5 θ 120 3 5 2 5 θ 40 ,   0
Aligned
inequality
( 24 , 12 , 2 , 1 )
0 < θ < 12 4 x 1 + x 2 = θ 12 17 θ 240 ,   17 θ 60 17 θ 144 ,   17 θ 72 17 θ 96 ,   17 θ 96
12 θ 48 4 x 1 + x 2 = θ 12 17 θ 240 ,   17 4 17 θ 240 min 17 θ 144 , 17 4 ,   max 17 4 17 θ 144 , 0 min 17 θ 96 , 17 4 ,   max 17 4 17 θ 96 , 0
48 < θ < 60 4 x 1 + x 2 = θ 12 ;
x 1 = x 2 = 0
17 17 θ 60 ,   17 4 17 θ 240 5 17 4 17 θ 48 ,   0 5 17 4 17 θ 48 ,   0
Misaligned
inequality
( 30 , 15 , 1 , 2 )
0 < θ < 30 x 1 + x 2 = θ 30 2 θ 60 ,   2 θ 60 2 θ 45 ,   2 θ 90 2 θ 60 ,   2 θ 60
θ = 30 x 1 + x 2 = θ 30 2 2 ,   2 2 2 2 3 ,   2 3 2 2 ,   2 2
30 < θ < 60 x 1 + x 2 = θ 30 ;
x 1 = x 2 = 0
2 2 θ 60 ,   2 2 θ 60 max 2 2 θ 90 , 2 2 2 θ 30 ,   max 2 2 θ 45 , 0 2 2 θ 60 ,   2 2 θ 60
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

An, X.; Dong, Y.; Wang, X.; Zhang, B. Cooperation and Coordination in Threshold Public Goods Games with Asymmetric Players. Games 2023, 14, 76. https://doi.org/10.3390/g14060076

AMA Style

An X, Dong Y, Wang X, Zhang B. Cooperation and Coordination in Threshold Public Goods Games with Asymmetric Players. Games. 2023; 14(6):76. https://doi.org/10.3390/g14060076

Chicago/Turabian Style

An, Xinmiao, Yali Dong, Xiaomin Wang, and Boyu Zhang. 2023. "Cooperation and Coordination in Threshold Public Goods Games with Asymmetric Players" Games 14, no. 6: 76. https://doi.org/10.3390/g14060076

APA Style

An, X., Dong, Y., Wang, X., & Zhang, B. (2023). Cooperation and Coordination in Threshold Public Goods Games with Asymmetric Players. Games, 14(6), 76. https://doi.org/10.3390/g14060076

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop