1980
DOI: 10.1007/bf01069125
|View full text |Cite
|
Sign up to set email alerts
|

Composition of games without side payments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

1988
1988
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 1 publication
0
10
0
Order By: Relevance
“…Second, they assume that for all S ⊂ N , the value of V (S) is downward-sloping 4 : for all x, y ∈ V (S) such that x S = y S and that x S ≤ y S , there exists z ∈ V (S) such that x S z S , which is a weaker version of the boundary condition introduced by Vilkov (1977). As was discussed in Greenberg (1985), such boundary conditions are not plausible for NTU theory because "corner games" do not satisfy this condition.…”
Section: Example 4 (Four-person Game)mentioning
confidence: 99%
See 1 more Smart Citation
“…Second, they assume that for all S ⊂ N , the value of V (S) is downward-sloping 4 : for all x, y ∈ V (S) such that x S = y S and that x S ≤ y S , there exists z ∈ V (S) such that x S z S , which is a weaker version of the boundary condition introduced by Vilkov (1977). As was discussed in Greenberg (1985), such boundary conditions are not plausible for NTU theory because "corner games" do not satisfy this condition.…”
Section: Example 4 (Four-person Game)mentioning
confidence: 99%
“…The convexity of games with nontransferable utility (NTU games) was first defined by Vilkov (1977) as an extension of the convexity of games with transferable utility (TU games), called ordinal convexity. While ordinal convex games arise in various economic applications 1 , they do not inherit interesting properties from the TU convex games.…”
Section: Introductionmentioning
confidence: 99%
“…It follows from his study that a convex VC is stable. His proof relies on a result on cores of ordinal games (see Vilkov 1977, or more directly Greenberg 1985. The nice result however is restricted to maximal VCs: A maximal VC is stable if and only if it is convex or put in another way, if and only if it is both superadditive and subadditive.…”
Section: Introductionmentioning
confidence: 99%
“…It turns out that this type of NTU-bankruptcy games does satisfy ordinal convexity (cf. Vilkov, 1977) together with coalitional merge convexity (cf. Hendrickx, Borm and Timmer, 2002).…”
Section: Introductionmentioning
confidence: 99%