Strong convexity of NTU games
type: Item
instance of: scholarly article
title: Strong convexity of NTU games
zbMATH Open document ID: 1259.91018
author: Takuya Masuzawa
published in: International Journal of Game Theory
publication date: 2012-08-13T00:00:00Z
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 6065353
zbMATH Keywords: cooperative game
zbMATH Keywords: convex game
zbMATH Keywords: NTU game
zbMATH Keywords: core
zbMATH Keywords: super-modularity
MaRDI profile type: Publication
full work available at URL: s00182-012-0330-1
OpenAlex ID: W2050574298
cites work: Cores of Convex Games Without Side Payments
cites work: A note on NTU convexity
cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP
cites work: Q5688335
cites work: Punishment strategies make the \(\alpha\)-coalitional game ordinally convex and balanced
cites work: Q3677437
cites work: A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
cites work: Cores of convex games
cites work: Convex games without side payments
cites work: Q4138513
DOI: 10.1007/S00182-012-0330-1
description: scientific article; zbMATH DE number 6065353