2018
DOI: 10.1016/j.geb.2017.08.004
|View full text |Cite
|
Sign up to set email alerts
|

Fair stable sets of simple games

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Characterization of those coalitional games with a stable core is still an open question although a stronger notion of the stable core is characterized in Jain and Vohra (2010). Stable sets have been found on several classes of games, such as assignment games (Núñez and Rafels, 2013), linear production games Shitovitz, 2000, 2010), pillage games (MacKenzie et al, 2015), patent licensing games (Hirai and Watanabe, 2018), matching problems (Herings et al, 2017), tournaments (Brandt, 2011), voting games (Talamàs, 2018), and exchange economies (Graziano et al, 2015(Graziano et al, , 2017. Non-cooperative foundations of stable sets can be found in Anesi (2010); Diermeier and Fong (2012).…”
Section: Introductionmentioning
confidence: 99%
“…Characterization of those coalitional games with a stable core is still an open question although a stronger notion of the stable core is characterized in Jain and Vohra (2010). Stable sets have been found on several classes of games, such as assignment games (Núñez and Rafels, 2013), linear production games Shitovitz, 2000, 2010), pillage games (MacKenzie et al, 2015), patent licensing games (Hirai and Watanabe, 2018), matching problems (Herings et al, 2017), tournaments (Brandt, 2011), voting games (Talamàs, 2018), and exchange economies (Graziano et al, 2015(Graziano et al, , 2017. Non-cooperative foundations of stable sets can be found in Anesi (2010); Diermeier and Fong (2012).…”
Section: Introductionmentioning
confidence: 99%