Convex Games
Convex Games is a cooperative game in which the characteristic function exhibits supermodularity, meaning the marginal contribution of any player to a coalition increases as the coalition grows, thereby ensuring the game has a non-empty core and exhibits properties favorable to stable coalition formation.
235
Publications
13.4K
Citations
405
Authors
249
Institutions
Publications per year
2017–2026
36
Variants
Supermodular Games
Parents
235
Lloyd S. Shapley · International Journal of Game Theory · 1971 · 1.6K citations
Note on non-cooperative convex game
Hukukane Nikaidô, Kazuo Isoda · Pacific Journal of Mathematics · 1955 · 422 citations · Full text
Jean‐Pierre Aubin · Mathematics of Operations Research · 1981 · 334 citations
1–5 of 235
405
14
h-index
10
h-index
6
h-index
5
h-index
5
h-index
1–5 of 405
249

Tilburg University
Tilburg, The Netherlands
13 h-index
21 publications
766 citations
Alexandru Ioan Cuza University
Iasi, Romania
9 h-index
9 publications
283 citations
Hebrew University of Jerusalem
Jerusalem, Israel
8 h-index
9 publications
769 citations

Radboud University Nijmegen
Nijmegen, The Netherlands
5 h-index
7 publications
360 citations
Waseda University
Tokyo, Japan
5 h-index
6 publications
342 citations
Tinbergen Institute
Rotterdam, The Netherlands
5 h-index
7 publications
291 citations
Maastricht University
Maastricht, The Netherlands
5 h-index
6 publications
85 citations
University of Pennsylvania
Philadelphia, United States
5 h-index
10 publications
406 citations
1–8 of 249
20 publications · 2.5K citations
14
h-index
9 publications · 1.2K citations
9
h-index
7 publications · 157 citations
7
h-index
7 publications · 151 citations
7
h-index
Repository · 7 publications · 163 citations
7
h-index
1–5