1997
DOI: 10.1007/s001820050034
|View full text |Cite
|
Sign up to set email alerts
|

Quasi-Cores in Bargaining Sets

Abstract: Abstract:We propose a nonempty-valued subsolution of the Mas-Colell Bargaining Set on the class of TU games satisfying grand coalition zero-monotonicity, a weaker condition than superadditivity, zero-monotouicity and balaneedness. The subsolution is a slight modification of the Shapley-Shubik Quasi-Core. The Zhou Bargaining Set is a refinement of the Mas-Colell Bargaining Set. We also give a nonempty-valued subsolution of the Zhou Bargaining Set on the class of all TU games satisfying grand coalition superaddi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
12
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(13 citation statements)
references
References 11 publications
1
12
0
Order By: Relevance
“…Our first theorem extends his result to NTU games similarly to the way Scarf (1967) had extended the core nonemptiness theorem of Bondareva (1963) and Shapley (1967). Shimomura (1997) proves that on the class of TU games, the steady bargaining set and the Zhou bargaining set are nonempty for every coalition structure that can produce the maximal sum of payoffs to all the players. Combining this result with our first theorem, we demonstrate that in a NTU coalitional game, it is not easily predictable which coalitions are likely to form, but the idea of the bargaining set helps explain how coalition structures and payoff allocations are determined.…”
Section: Introductionsupporting
confidence: 66%
See 2 more Smart Citations
“…Our first theorem extends his result to NTU games similarly to the way Scarf (1967) had extended the core nonemptiness theorem of Bondareva (1963) and Shapley (1967). Shimomura (1997) proves that on the class of TU games, the steady bargaining set and the Zhou bargaining set are nonempty for every coalition structure that can produce the maximal sum of payoffs to all the players. Combining this result with our first theorem, we demonstrate that in a NTU coalitional game, it is not easily predictable which coalitions are likely to form, but the idea of the bargaining set helps explain how coalition structures and payoff allocations are determined.…”
Section: Introductionsupporting
confidence: 66%
“…We prove Theorem 1 in the appendix. By Theorem 3.2 in Shimomura (1997) and Olive. We denote them by , , and , respectively.…”
Section: The Zhou Bargaining Set and The Steady Bargaining Setmentioning
confidence: 80%
See 1 more Smart Citation
“…The counterobjections defined by weak improvements make Zhou's bargaining set nonempty for general games and the mapping ZB upper hemicontinuous in v given N. Shimomura (1997) defines two modifications of the Zhou bargaining set. In the first, counterobjections are defined by strict improvements, leading to the strict Zhou bargaining set ZB * .…”
Section: Modified Versionsmentioning
confidence: 99%
“…Shimomura (1997) modifies the Mas-Colell bargaining set and the Zhou bargaining set by defining both objections and counterobjections with strict improvements Izquierdo and Rafels (2018). call them the Mas-Colell bargaining setá la Shimomura and the Zhou bargaining setá la Shimomura, respectively.…”
mentioning
confidence: 99%