On the nonemptiness of approximate cores of large games

We provide a new proof of the nonemptiness of approximate cores of games with many players of a finite number of types. Earlier papers in the literature proceed by showing that, for games with many players, equal-treatment cores of their “balanced cover games,” which are nonempty, can be approximated by equal-treatment ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}-cores of the games themselves. Our proof is novel in that we develop a limiting payoff possibilities set and rely on a fixed point theorem.


Introduction
The core is an anchoring concept in game theory going back, in its origins, to Edgeworth's contract curve, and the contributions of Debreu and Scarf (1963) and Aumann (1964). The core remains a central concept in economics and most recently, in market design; see, for example, Roth (2002). Even in games with many, but finite numbers of players, however, the core may be empty. The addition of a single player to a large game with a nonempty core may result in a game with an empty core. The problem of the emptiness of the core is especially salient in economies with public goods subject to congestion and exclusion (local public goods) or in economies with clubs. Even in pure exchange economies, the nonemptiness of the core can depend on whether commodities are infinitely divisible. It is, however, a remarkable fact that, as established by Wooders (1983) and a number of subsequent papers, games with many players satisfying apparently mild conditions have nonempty approximate cores.
In this paper, inspired by the payoff-dependent balancedness notion 1 of Herings and Predtetchinski and Herings (2004) and Bonnisseau and Iehlé (2007), 2 we demonstrate nonemptiness of approximate cores for sequences of games with arbitrary distributions of players. Recall that much of the literature on approximate cores of NTU games, beginning with Wooders (1983) and most recently Kovalenkov and Wooders (2001), Kovalenkov and Wooders (2003) and Wooders (2008), establishes nonemptiness of approximate cores of large games by showing that payoffs in the cores of derived "balanced cover" games can be approximated by feasible payoffs of the original games. Quite surprisingly, a modification of a key construct from the literature on payoff-dependent balancedness, a correspondence from limiting feasible payoffs to distributions of players types 3 achieving them, enables us to establish that for large games limiting payoffs vary continuously with the distribution of player types. With such a correspondence in hand, we can bypass approximation of the original games by balanced cover games and simply appeal to a fixed point argument rather than to approximating balanced games. An especially interesting aspect of our proof is that we obtain a limiting payoff set that is the analogue of the limiting utility function of Wooders (1994) describing TU games with many players as market games. This paper lays a foundation for further investigation of many player nontransferable utility games as market games.
More specifically, for sequence of games with growing numbers of players of each of a finite number of types and arbitrary distributions of player types we introduce a set of limiting equal-treatment payoffs, denoted by Γ , and a correspondence from payoffs in Γ to distributions of players types able to achieve them. A limiting equal-1 Payoff-dependent balancedness generalizes the well-known notion of Scarf balancedness for NTU games. 2 As they discuss, the intuition behind the Bonnisseau and Iehlé (2007) result comes from the existence of a general pricing rule equilibrium in an economy with a nonconvex production sectors, as in Bonnisseau and Cornet (1988), Bonnisseau et al. (1991) and Bonnisseau (1997), which show that core payoffs correspond to equilibrium allocations of a suitably constructed two-production-set auxiliary economy. 3 In interpretation, a distribution of player types is simply a list of percentages of players of each type. For large games it also reflects a set of players á la Aubin (1979), where players have different participation rates (see also Florenzano 1990;Allouch and Florenzano 2004). treatment payoff is approximately feasible for some group, possibly large, described by the distribution of player types in the group. We require essentially four conditions for our results: 1. Superadditivity (SA): Any group N of players can realize at least the payoffs achievable by cooperation only within groups in a partition of N ; 2. Players of the same type are substitutes (PSTS): The payoff possibilities set of a group N depends on the types profile of the group and not on the names of its members; 3. Convexity (CONV): For each group N the payoff possibilities set is convex; 4. Small group effectiveness (SGE): All or almost all gains to group formation can be realized by groups uniformly bounded in size.
Our result extends that of Wooders (1983) in that our limiting construct is not restricted to games with a fixed distribution of player types; instead we consider all sequences of games with growing player sets converging to some given distribution of types. While we use SGE, Wooders (1983) uses the apparently milder condition of boundedness of per capita payoffs. We use SGE since it is easier to work with and closely related. Recall that Wooders (2008, Theorem 2) uses similar conditions as employed in this paper to demonstrate that, for games with a compact metric space of player types, given ε > 0 there is an integer η 0 (ε) such that all games with more than η 0 (ε) players have nonempty equal-treatment ε-cores.
Although both Predtetchinski (2005) and Allouch and Predtetchinski (2008) use the notion of payoff-dependent balancedness, their approaches differ in many aspects from that of the current paper. First, the current paper deals with a sequence of games defined in characteristic form with possibly ever-increasing equal-treatment payoff sets. Our framework, as Wooders (1983) and subsequent papers on games with many players, can accommodate a general class of exchange economies including ones with (local) public goods and clubs. In contrast, Predtetchinski (2005) and Allouch and Predtetchinski (2008) treat a pure exchange economy, where equal-treatment payoff sets are identical under replications of the total player set. As a result, in our approach both feasible payoffs and core concepts are defined approximately for large finite games, in contrast to Predtetchinski (2005) and Allouch and Predtetchinski (2008) where feasible payoffs and core concepts are exactly defined. Moreover, the crucial argument in our paper, based on small group effectiveness, is to show that payoffs achieved in the limit by a distribution of player types vary continuously with the distribution of player types. However, in Allouch and Predtetchinski (2008) such a continuity argument is inferred directly from the upper semi-continuity of utility functions over feasible allocations. Finally, in our approach we seek a fixed point for an arbitrary limiting distribution of player types, (both rational and nonrational), unlike Allouch and Predtetchinski (2008) where the distribution of players type is fixed and rational.
The paper is organized as follows. In Sect. 2, we present the basic features of games with a finite number of types of players. In Sect. 3, we present our main result on the nonemptiness of approximate cores of a sequence of games with a finite number of types of players. Section 4 provides the proof of our main result, and we conclude in Sect. 5 with a comparison to the literature.

NTU games with a finite number of types of players
We investigate games with a fixed finite set of player types T = {1, . . . , T }. Let where Z + is the set of nonnegative integers. Note that N is a countably infinite set. A group of players is a finite subset of N , with a typical group denoted by N ⊂ N . The profile of N , denoted by pro(N ), is defined as follows: where pro t (N ) denotes the number of players of type t in N . Also, let |N | = t∈T pro t (N ) denote the number of players in N . We take as given a correspondence V mapping each group N into a subset of R N . For each group of players N , the correspondence has the following properties: We also assume that correspondence V satisfies the following properties.

Superadditivity (SA)
For any group of players N and any partition P(N ) Superadditivity implies that any payoff vector that can be realized by groups in a partition of a group of players is feasible for the entire group of players.
The following notion of substitute players in NTU games was introduced in Wooders (1983). For NTU games, to capture the notion of substitutes it is necessary to require not only that substitute players make the same contribution to any group they may join but also that they are interchangeable when they are both in the same group.

Players of the same type are substitutes (PSTS)
For any group of players N and any two players (t, q) and (t, q ) (a) if (t, q) / ∈ N and (t, q ) / ∈ N , given any denote the subset of payoff vectors that represent equal-treatment payoffs in V(N ). Note that V etp (N ) is nonempty since it always contains the 0 payoff and is unconstrained for player types that do not appear in N . Moreover, in view of PSTS, it holds that the equal-treatment payoff set V etp (N ) of a group of players N depends only on the profile pro(N ). 5

Convexity (CONV)
Convexity of payoff sets is often used in studies of NTU games and is satisfied for the special case of games with transferable utility. For our purposes in this paper, convexity is used to ensure that the average of any finite set of feasible payoffs is feasible.

Small group effectiveness (SGE)
For every ε > 0, there is a positive integer τ (ε) such that each group N ⊂ N has a partition P(N ) = (N k ) K k=1 with the properties that |N k | ≤ τ (ε) for each k, and Small group effectiveness ensures that, given arbitrarily small ε, almost all (within ε) gains to group formation can be realized by a partition of the group of players into groups uniformly bounded in size. 6 3 The limiting utility possibilities set for NTU games Following Scarf's (1967) definition of an NTU game, with every group N ⊂ N we associate an NTU game (N , V ) defined by the property that for each nonempty subset S of N it holds that V (S) = V(S) × R N \S . Thus, given the player set N , the correspondence V determines the NTU game (in coalitional function form) (N , V ), where N is a finite set (the set of players) and V is a set-valued function that assigns to each nonempty subset S of N (a group or coalition ) a nonempty subset V (S) of R N , called a payoff possibilities set or simply a payoff set.
A payoff vector for the game Informally, a feasible payoff vector x is in the ε-core if no group of players can improve upon x by more than ε for each player in the group. 7 During the proof of the following theorem, we will use the following notation: Then there exists v * ∈ R T satisfying the property: for every ε > 0 there is an integer r ε such that for each n ≥ r ε , (v * − ε1) N n is in the ε-core of (N n , V ).
Our novel proof is contained in the next section. In the remainder of this section, we introduce some notation used in the proof and indicate how the result is obtained. Define a subset Γ of R T as follows: The set Γ represents equal-treatment payoffs that are feasible or approximately feasible for some group, possibly large, described by the fixed distribution of player types in the group. When (v − ε1) ∈ V etp (N ε ) we say that N ε approximately achieves v.
Footnote 6 continued small groups, was introduced in Wooders (2008) for NTU games and in Wooders (1992) for TU games.
Our notion here of SGE is slightly more restrictive than that of Wooders (2008), but the difference is simply for convenience. 7 This notion of ε-core is sometimes called the uniform ε-core.
Note that given v ∈ Γ it may be that there does not exist a group N that can fully achieve v, that is, there need not exist a group N such that v ∈ V etp (N ); there will exist such a group only if all gains to group formation can be exhausted by groups bounded in size. 8 Note also that, by SA for every group N ε containing a positive integer multiple of players of each type as N ε , that is, for every group N such that pro(N ε ) = kpro(N ε ) for any positive integer k.
Given v ∈ Γ , there are multiple groups with different distributions that can all approximately achieve v. Thus, we define the correspondence Π : Γ ⇒ Δ as follows: The set Π(v) consists of those distributions s of player types for which v is approximately feasible, that is, those distributions of player types that, in the definition of Γ are required to exist. Note that the groups N ε may need to become arbitrarily large as ε becomes small. Note also that nonemptiness of the set Π(v) follows immediately from the definitions of Γ and Π .
The graph of the correspondence Π is denoted by G(Π ) and defined by We will show that, for each v ∈ cl(Γ ), the set Π(v) is nonempty and convex. Let G( Π) denote the graph of the correspondence Π . We will show that G( Π) is the closure of G(Π ) with respect to R T × Δ.
Our proof proceeds by showing that limiting payoffs vary continuously with the distribution of player types. That is, we show that Π is a continuous correspondence from distributions of player types to limiting equal-treatment payoffs achievable, or almost achievable, by large games with close distributions of players types. We can then appeal to a fixed point theorem to obtain the result that there is a point v * ∈ ∂(cl(Γ )) such that s * ∈ Π(v), which turns out to be sufficient to prove our main theorem.

The proof of the main result
(1) If s ∈ Δ ∩ Q T then (v, s) ∈ G(Π ). 8 That is, unless a form of strict small group effectiveness is satisfied.
(2) For any sequence of groups {N n } n satisfying lim n→+∞ pro(N n ) |N n | = s ∈ intΔ (with possibly pro(N n ) |N n | = s n ) and |N n | → ∞, for every ε > 0 there exists r ε such that for each n ≥ r ε , it holds that (v − ε1) ∈ V etp (N n ).
Proof of Proposition 1 (1) The proof of (1) has two parts. In Part (a), given the sequence {(v n , s n )} n converging to (v, s), using SGE, we determine a finite collection of distributions of player types such that for any distribution s in the collection it holds that (v − 2ε 3 1) ∈ V et p (S ) for any group S with distrbution of types equal to s . Let M * denote this collection of profiles. We use this result in Part (b) where it is shown that we can restrict attention to distributions in the collection M * .
Part (a): Let us fix ε > 0. Since s n ∈ Π(v n ) and thus has rational coefficients, there exists a group N n ε such that Since V satisfies SGE, there is an integer τ ( ε 3 ) and a partition P(N n Since there is only a finite number of profiles for groups N satisfying |N | ≤ τ ( ε 3 ), we can denote their number by a finite integer M and let p 1 , . . . , p m , . . . , p M be a list of these profiles. Thus, we can write where β n m is the number of subsets N n ε,k ∈ P(N n ε ) such that pro(N n ε,k ) = p m . Since 0 ≤ β n m ≤ |N n ε | we can assume, without loss of generality, that for each m = 1, . . . , M, the sequence ( β n m |N n ε | ) converges to a real number β * m . Let Then, it holds that Thus, it holds that supp(s) = ∪ m∈M * supp( p m ).
Moreover, by PSTS, for every group N such that pro(N ) = p m for some m ∈ M * , for all n sufficiently large, it holds that

Rearranging terms, it follows that
Part (b): We next show that we can restrict attention to groups with profiles in the set M * . Since s ∈ Δ ∩ Q T , there is an integer d such that ds has integer components. In view of (2), for each n, the set Hence, in view of (2), given δ ∈]0, 1 − λ * [, for all n sufficiently large, it holds that This implies that (l n − 1) ∈ A n , which is a contradiction to l n being the infimum of A n . Let N n, * ε ⊂ N n ε be a group satisfying pro(N n, * ε ) = m∈M * β n m p m Let also E n,s ε be a group satisfying N n, * ε ⊂ E n,s ε and pro(E n,s ε ) = l n ds. Given the construction of Take the average payoff vector over all such groups D, which yields an equal-treatment payoff vector that belongs to V(E n,s ε ) since CONV. 9 For sufficiently large n, this average payoff vector will be greater than (v − ε1) E n,s ε . Hence, it holds that which implies that s ∈ Π(v).
(2) In the following, we will show that for any sequence of groups {N n } n with a limiting distribution of player types given by s, for all n sufficiently large, N n can be approximated (in terms of numbers of players of each type) by groups with profiles in the collection ( p m ) m∈M * , which, in turn, implies that N n can approximately achieve the payoff v.
We require the following theorem about projections on a convex set.

Projection theorem
Let C be a nonempty closed convex set of R T .
(i) For any x ∈ R T there exists a unique vector P C (x) = arg min z∈C z − x 2 called the projection of x on C. 10 (ii) The vector P C (x) can be defined as the only vector with the property (y − P C (x)) · (x − P C (x)) ≤ 0, ∀y ∈ C.
Let {N n } n be an arbitrary sequence of groups satisfying lim n→+∞ pro(N n ) |N n | = s (with possibly pro(N n ) |N n | = s n ) and |N n | → ∞. Then, taking ε (and other definitions) as given in the proof of Part (a) in (1) above, let c(N n ) denote the projection of pro(N n ) on the convex cone C spanned by ( p m ) m∈M * . First, note that since C is a convex cone spanned by ( p m ) m∈M * it follows from (1) that s ∈ C. We claim that lim n→+∞ c(N n ) |N n | = s.
Suppose not. Then, passing to a subsequence if necessary, we may assume that lim n→+∞ c(N n ) |N n | = s = s.
Since s ∈ C and C is a convex cone, it holds that for each n Taking the limit it holds that s − s 2 2 ≤ 0, which is a contradiction. For each n, let F n = {θ ∈ [0, 1] | pro(N n ) − θ c(N n ) ≥ 0}, which is nonempty since it contains 0. Let θ n = max F n . We claim that lim n→+∞ θ n = 1. Suppose not. Then passing to a subsequence if necessary, we may assume that lim n→+∞ θ n = θ * for some θ * ∈ [0, 1[. Hence, Then, since (2) and s ∈ intΔ, for some δ > 0, for all n sufficiently large, it holds that which implies that (θ n +1) 2 ∈ F n . This is a contradiction since, for all n sufficiently large, it holds that θ n < (θ n +1) 2 . Note that we can write c(N n ) = m∈M * ξ n m p m , for some real numbers ξ n m ∈ R + . Let Integer(θ n c( where, for any u ∈ R + , [u] denotes the integer part of u. Let N n ⊂ N n be a group satisfying pro( N n ) = Integer(θ n c(N n )). Note that Moreover, from SA and (3) it follows that for a large enough n Therefore, by CONV, one could subsidize the left-overs (N n \ N n ) so that

Proposition 2 There is a bound B
Proof of Proposition 2 Taking again ε (and other definitions) as given in the proof of Part (a) in (1)  Clearly, B is well defined and finite. Let t ∈ supp(s). From (2) it follows that t ∈ supp( p m ) for some m ∈ M * , which in view of PSTS and (3), implies that v t ≤ B.

Recall that
Obviously, given that the domain of G(Π ) is Γ ×(Δ∩Q T ), there are some converging sequences {(v n , s n )} n with each element in the sequence contained in the graph but the limits of the sequences are not. Given that having a closed graph is crucial to be able to use a fixed point argument, we get around this difficulty by constructing an auxiliary correspondence with a closed graph. Define the correspondence Π : cl(Γ ) ⇒ Δ as follows: for each v ∈ cl(Γ ) Let G( Π) denote the graph of the correspondence Π . The following proposition shows that G( Π) is the closure of G(Π ) with respect to R T × Δ.
Proposition 4 For each v ∈ cl(Γ ) the set Π(v) is nonempty and convex.
The set cl(Γ ) is a nonempty, closed, and comprehensive from below subset of R T . Note that the set cl(Γ ) is a proper set of R T . Define W as the set where B is defined in Proposition 2. A point v ∈ W belongs to the boundary of W if and only if either v ∈ ∂(cl(Γ )) or has v t = B + 1 for some t = 1, . . . , T .
Proposition 5 There is a homeomorphism h from the space Δ to the space ∂ W ∩ [−1, +∞[ T such that h(s) t = −1 whenever s ∈ Δ and t ∈ T \supp(s).
Proof of Proposition 5 Let s ∈ Δ be given. Let R be the ray emanating from −1 = (−1, . . . , −1) in the direction of s. Thus, every point ρ of R is of the form ρ = −1+σ s for some nonnegative real number σ . It is clear that, since W is closed, comprehensive from below, and bounded from above, R intersects the boundary of W at exactly one point.
To see that R does intersect ∂ W , observe that −1 belongs to both the set W and the ray R. Thus, the set R 1 = R ∩ W is nonempty. Furthermore, there is a ρ ∈ R such that ρ t ≥ B + 1 for some t ∈ supp(s), so that ρ lies outside the interior of W . Therefore, the set R 2 = R ∩ (R T \ intW ) is nonempty. Thus, R 1 and R 2 are nonempty closed subsets of R whose union is R. By connectedness of R, the set R 1 ∩ R 2 = R ∩ ∂ W is nonempty.
To show that the intersection of R and W is a singleton, suppose that the set R ∩∂ W contains two distinct points v and v. Thus, v = −1 + σ s and v = −1 + σ s for some nonnegative reals σ and σ . Without loss of generality, we can assume that σ < σ . For each t ∈ supp(s), we have v t < v t < B + 1. For each t ∈ T \supp(s) (possibly empty), we then have v t = v t = −1. Note that since v ∈ cl(Γ ), it is easy to check thatv Since v t <v t for each t ∈ T , it follows that v is in the interior of cl(Γ ). Moreover, since v t < B + 1 for each t ∈ T , it follows from comprehensiveness that v is in the interior of W , which is a contradiction. Define the map h from Δ to ∂ W ∩ [−1, +∞[ T by letting h(s) be the unique point in the intersection of the ray R and the set ∂ W . We now demonstrate that h has an inverse. Let g denote the map from ∂ W ∩ [−1, +∞[ T to Δ given by the equation The map g is well defined since the point −1 lies in the interior of W . It is easy to see that g is indeed the inverse of h, that is, h •g and g•h are equal to the respective identity maps. Clearly, g is a continuous map. Furthermore, because its domain is compact and the codomain is Hausdorff, it carries closed sets to closed sets. Therefore, h is also a continuous map. This proves that h is a homeomorphism.
The rest of the proof relies on the Talman and Yang (2009) version of the wellknown Fan's coincidence theorem, as stated below. That theorem addresses a domain consisting of a nonempty and convex subset Y of R N . For ease of translation of the theorem to our context, we restrict the domain to be the simplex in R T . Let N (Δ, s) = {z ∈ R N | (s − s ) z ≥ 0 for each s ∈ Δ} denote the normal cone of the set Δ at the point s. A zero point of a correspondence Φ : Δ ⇒ R T is a point s of Δ such that Φ(y) contains the zero point.
For ease in reading, we state the following result using the simplex rather than an arbitrary compact convex set.
Theorem (Talman and Yang) Let Φ : Δ ⇒ R T be a correspondence with nonempty convex values having a compact graph. Suppose that for each s ∈ Δ and for each z ∈ N (Δ, s) there exists a φ ∈ Φ(s) such that z φ ≤ 0. Then, Φ has a zero point.
Proof of Proposition 6 Define the correspondence Φ : Δ ⇒ R T by letting Φ(s) = Π(h(s)) − {s * } for each s ∈ Δ. Clearly, the correspondence Φ has nonempty and convex values. Its graph is closed, because h is continuous and the graph of Π is closed. Since Φ maps a compact set Δ into a compact set Δ − {s * }, its graph is, in fact, a compact set.
We now need to verify that the conditions of the above-fixed point theorem are satisfied. Let s ∈ Δ be given and let v denote the vector h(s). Then, the normal cone of Δ at s is the set where (e 1 , . . . , e T ) is the standard canonical basis of R T . Let z ∈ N (Δ, s) be given. If supp(s) = T , then every z ∈ N (Δ, s) is proportional to the vector 1. In this case, since Φ(s) ⊂ Δ − {s * }, the equality z φ = 0 holds for each φ ∈ Φ(s). If T \supp(s) is nonempty, then, v t = h(s) t = −1, for each t ∈ T \supp(s). Letŝ ∈ Δ defined as followsŝ and {(ŝ n )} n be a sequence in Δ ∩ Q T such that lim n→+∞ŝ n =ŝ andŝ n t = 0, for each t ∈ supp(s). Let N n be a group satisfying pro(N n ) |N n | =ŝ n .
Finally, Proposition 6, together with (2) in Proposition 1, implies that for every ε > 0 there exists r ε such that for each n ≥ r ε , (v * − ε1) N n is in the ε-core of (N n , V ).

Some relationships to the literature
To relate our work to the literature, we begin with Wooders (1983). We note that the results of that paper have played a role in much subsequent work on cooperative games with many players (see, for example, Wooders (1994) and Wooders (2001, 2003) and on economies with clubs or local public goods (see, for example, Wooders 1997;Conley and Wooders 2001;Allouch and Wooders 2008).
Before proceeding we require another definition:

Per capita boundedness (PCB)
The correspondence V satisfies per capita boundedness if there is a constant K such that if v ∈ V etp (N ) then v t ≤ K for each t such that (t, q) ∈ N for some q. Note that PCB is less restrictive than SGE, but when there are many players of each type then the two concepts are closely related. Following is a restatement of the main theorem of Wooders (1983) using the notation of this paper and Lemmas in Wooders's proof.
Theorem (Wooders 1983) Assume V satisfies SA, PSTS, PCB, and CONV. Let s ∈ intΔ ∩ Q T and let {(N n , V )} n be a sequence of games such that |N n | → ∞ and, for each n, Then, there exists v * ∈ R T satisfying the property: for every ε > 0 there is an integer r ε such that for each n ≥ r ε , (v * − ε1) N n is in the ε-core of (N n , V ).
Note that s can be any vector in intΔ ∩ Q T . Thus, for sequences of games where all games in the sequence have the same percentage of players of each type, the main theorem of Wooders (1983) implies the result of this paper. The proof, however, is quite different. In some sense, Wooders (1983) approaches the limiting payoff v * "from below" while the current paper starts with defining a limiting set for every possible player profile. Essentially, Wooders's proof shows that the limit of the set of equaltreatment payoff vectors achievable by a sequence of games with a fixed distribution of player types is the same as the limit of those equal-treatment games achievable by the associated sequence of balanced cover games. In contrast, we look directly at the limiting sets. We also show that the sets of equal-treatment payoffs vary continuously with as the distribution of player types varies. Our result also extends that of Wooders (1983) since she treats a fixed distribution of player types while we treat all sequences of growing games converging to the same limiting distribution of player types; this difference is reflected in the part of our proof using the projection theorem.
Our work in this paper also relates to Wooders (2008) which considers a compact metric space of player types and demonstrates nonemptiness of approximate cores for all sufficiently large (but finite) games derived from the structure. That paper uses somewhat different conditions than the current paper and has a different purposenamely to relax the finite-type assumption, so we will not discuss the relationships in any detail.

Conclusions
We present an extension of the main result of Wooders (1983). In work in progress, we use our approach in this paper to relate the Aumann-core (with coalitions of positive measure) and the f -core of Kaneko and Wooders (1986) and Kaneko and Wooders (1996) 11 and show their equivalence for games with many players. We also establish the equivalence of core outcomes for other models allowing "large" players (or positive measure).
In conclusion, we note that the theory of cooperative games satisfying either per capita boundedness or small group effectiveness has found application in club theory and the theory of local public goods (c.f., Allouch and Wooders (2008) and references therein), in the study of market games (Wooders 1994), and recently, in security exchanges (Faias and Luque 2016). All these papers advance the notion that large cooperative games, with a compact metric space of player types, are market games. The general theories of approximate cores of games with many players can also be used to obtain a special case of a non-emptiness result due to Gersbach et al. (2015) on household formation. While we require convexity of payoff sets, if we had instead allowed a "left-over" set of players as in Shubik and Wooders (1983) or Kovalenkov and Wooders (2003), then a result analogous to that of this paper could be immediately applied to matching markets, as in the celebrated volume of Roth and Sotomayer (1990) and in multiple extensions of matching markets such as Legros and Newman (2002). Another application, in progress, uses SGE in the study of economies with incomplete information (see Kamishiro et al. 2016). In view of the multiplicity of applications already in the literature, we anticipate that our work in this paper will help in the development of yet further applications. and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.