Comparative cooperative game theory
type: Item
instance of: scholarly article
title: Comparative cooperative game theory
zbMATH Open document ID: 0709.90105
DOI: 10.1007/BF01761073
published in: International Journal of Game Theory
publication date: 1990-01-01T00:00:00Z
review text: This paper considers comparisons between two n-person cooperative games v and \(\hat v\) with and/or without sidepayments. Comparisons are made based on the criterion: whether or not, for each core imputation y of game v, there exists a core imputation x of game \(\hat v\) such that x Pareto dominates y. Two other variations of the criterion are given (the reviewer does not understand the motivation for these criteria). Then the paper gives certain properties of these criteria and shows that these criteria can be characterized for the classes of convex games and exact games. Also, the paper introduces the class of no-gap games, which is smaller than the class of exact games and is larger than the class of convex games. Some results for games with sidepayments hold for games without sidepayments.
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 4167876
zbMATH Keywords: sidepayments
zbMATH Keywords: core imputation
zbMATH Keywords: convex games
zbMATH Keywords: exact games
zbMATH Keywords: no-gap games
author: Tatsuro Ichiishi
reviewed by: Mamoru Kaneko
MaRDI profile type: Publication
cites work: Convex games and extreme points
cites work: Q3236243
cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP
cites work: Management versus Ownership, I
cites work: Q3674431
cites work: Entry and structures of interest groups in assignment games
cites work: Cores of effectivity functions and implementation theory
cites work: A proof that the core of an ordinal convex game is a von Neumann- Morgenstern solution
cites work: Cores of exact games. I
cites work: Cores of convex games
cites work: Cooperative games with large cores
description: scientific article; zbMATH DE number 4167876