4.1 Nikaido-Isoda FunctionsWith each z-game,G z := {Φ i (z),u i (z,(·, ·))} i∈N, (29)we can associate a Nikaido-Isoda function (Nikaido <strong>and</strong> Isoda, 1955) given by⎫ϕ(z, (y, x)) := u(z,(y, x)) − u(z,(x, x)) ⎬:= P i∈N u i(z, (y i ,x −i )) − P (30)i∈N u ⎭i(z, (x i ,x −i )).LetF := {ϕ(z, (·, ·)) : z ∈ Z} , (31)denote the collection of Nikaido-Isoda functions associated with the collection of z-games, {G z : z ∈ Z}.4.2 The Graph of the Collective Security MappingsCorresponding to each Nikaido-Isoda function, ϕ(z,(·, ·)), thereisacollective securitymapping (i.e., a CS mapping), Λ(z,·) :Φ(z) → P w ∗ f(Φ(z)), givenbyy → Λ(z, y) :={x ∈ Φ(z) :ϕ(z,(y, x)) ≤ 0} . (32)Here, P w ∗ f(Φ(z)) is the collection of all nonempty, w ∗ -closed(<strong>and</strong>hencew ∗ -compact)subsets of Φ(z). For each choice profile y ∈ Φ(z) of the form y =(y i ,x −i ), Λ(z, y)is the (w ∗ -closed) set of choice profiles, x =(x i ,x −i ),inΦ(z) which are collectivelysecure against the potential noncooperative defection represented by the profiley =(y i ,x −i ) ∈ Φ(z) := Q i Φ i(z) (33)(i.e., ϕ(z, (y,x)) ≤ 0, fory =(y i ,x −i ) <strong>and</strong> x =(x i ,x −i ) implies that x =(x i ,x −i ) issecure against defection y =(y i ,x −i )). Note that if, given parameter z, x is containedin Λ(z,y) for all possible defection profiles y ∈ Φ(z), thatis,ifx ∈∩ y∈Φ(z) Λ(z,y) (34)then for each player i, x =(x i ,x −i ) is secure against any defection, including thoseof the form y =(y i ,x −i ).Thus,x ∈∩ y∈Φ(z) Λ(z,y) impliesu i (z,(y i ,x −i )) ≤ u i (z,(x i ,x −i )),for all pairs y =(y i ,x −i ) <strong>and</strong> x =(x i ,x −i ) - <strong>and</strong> conversely. Thus, the set of Nashequilibria given parameter z can be fully characterized as follows:x ∈ N (z) if <strong>and</strong> only if x ∈∩ y∈Φ(z) Λ(z, y). (35)Thus, the Nash USCO is given by,⎫z → N (z) =∩ y∈Φ(z) Λ(z, y). ⎬(36)⎭= {x ∈ Φ(z) :x ∈ Γ(z,x)}.Under assumptions [A-1], the function, ϕ(·, (·, ·)) which specifies for each parameterz ∈ Z a particular Nikaido-Isoda function (see (30)), has the following properties:20
(F1) ϕ(·, (·, ·)) is continuous on the compact metric space, Z × (X × X);(F2) ϕ(z,(·,x)) is quasiconcave in y on X.Given parameter z ∈ Z, the collective security mapping is given byy → Λ(z, y) :={x ∈ Φ(z) :ϕ(z,(y, x)) ≤ 0} .Moreover, given z, the graph of the collective security mapping is given byGrΛ(z, ·) :={(y,x) ∈ Φ(z) × Φ(z) :x ∈ Λ(z, y)}. (37)Thus, if (y 0 ,x 0 ) ∈ GrΛ(z, ·), then strategy profile x 0 ∈ Φ(z) is secure against defectionprofile y 0 ∈ Φ(z) <strong>and</strong> we haveϕ(z,(y 0 ,x 0 )) ≤ 0.Henceforth, for each z ∈ Z, wewilldenotebyK(z) the graph of the CS function. Wewill refer to the mapping, z → K(z), astheGCS function. Thus, the GCS functionis given byz → K(z) :=GrΛ(z,·) for all z ∈ Z. (38)The mapping K(·) is ρ Z -w ∗ × w ∗ -upper semicontinuous (i.e., usc) if for every setF, w ∗ × w ∗ -closed in Φ(z) × Φ(z), thesetK − (F ):={z ∈ Z : K(z) ∩ F 6= ∅}is ρ Z -closed in Z, or equivalently, if for every set G, w ∗ × w ∗ -open in Φ(z) × Φ(z),the setK + (G) :={z ∈ Z : K(z) ⊂ G}is ρ Z -open in Z. Also, recall that because Φ(z)×Φ(z) is w ∗ ×w ∗ -compact, K(·) is usc if<strong>and</strong> only if K(·) has a ρ Z -w ∗ ×w ∗ -closed graph. Finally, note that (z,(y, x)) ∈ GrK(·)if <strong>and</strong> only ifϕ(z, (y, x)) ≤ 0.Thus, it follows immediately from the continuity of the function ϕ(·, (·, ·)) on Z ×(X × X) (see property F1 above) that K(·) has a ρ ρZ ×w ∗ ×w∗-closed graph whereρ ρZ ×w ∗ ×w ∗ := ρ Z + d w ∗ ×w ∗ <strong>and</strong> hence that K(·) is usc.Lemma 7 (The KFC mapping, K(·), isuppersemicontinuous)Suppose assumptions [A-1] hold. Then the mappingis ρ Z -w ∗ × w ∗ -upper semicontinuous.z → K(z)21
- Page 5: cally approximated by continuous fu
- Page 12 and 13: the set x 0 x 1 ∈ C w ∗ f(X) is
- Page 14 and 15: defined on some probability space,
- Page 16 and 17: contains at most one arc (i.e., ¯
- Page 18 and 19: into the collection of Ky Fan sets
- Page 20 and 21: 3.1 Best Response MappingsLetting p
- Page 24 and 25: Because Φ(z) × Φ(z) is w ∗ ×
- Page 26 and 27: where for all n, C n ∈ S E n,then
- Page 28 and 29: Definition 4 (The 3M Property - The
- Page 30 and 31: Given (48) and the fact that for n
- Page 32 and 33: We note that if m(z) ∈ P w ∗ f(
- Page 34 and 35: 6.3 AK Convergence of Minimal Nash
- Page 36 and 37: and Gr ρZ ×w ∗f ∗ (·) is the
- Page 38 and 39: In particular, for all n ≥ N 0 an
- Page 40 and 41: the cutting defined by the cut poin
- Page 42 and 43: According to our main result, under
- Page 44 and 45: By our main approximation result, f
- Page 46 and 47: 9 Appendix 1: USCO FundamentalsIn t
- Page 48 and 49: 9.3 Equi-QuasicontinuityIn order to
- Page 50 and 51: 9.5 Dense SelectionsFor each F ∈
- Page 52 and 53: 10 Appendix 2: The Proof of Lemma 8
- Page 54 and 55: Noting that if E ∈ D eE ,thenn eE
- Page 56 and 57: 12 Appendix 4: The Proof That All K
- Page 58 and 59: Letting E 1 =[E 1 \(X × U 2 )] ∪
- Page 60 and 61: [10] Bryant, V. W. (1970) “The Co
- Page 62: [42] Ward, L. E., Jr. (1958) “A F