Monotonic allocation schemes in clan games
type: Item
instance of: scholarly article
title: Monotonic allocation schemes in clan games
zbMATH Open document ID: 1064.91012
author: Mark Voorneveld
author: Stef Tijs
author: Sofia Grahn
published in: Mathematical Methods of Operations Research
publication date: 2003-06-23T00:00:00Z
review text: A game \((N, v)\) is a total clan game with clan \(C\in 2^N\setminus\{\emptyset, N\}\) if \(S(v)\) is a clan game with clan \(C\) for every \(S\in{\mathcal P}(C)= \{S\subseteq N: C\subseteq S\}\). The authors characterize this class of games by using monotonicity, veto power of the clan members and a concavity condition. They also show that each core element of a total clan game can be extended to both a population monotonic and a bi-monotonic allocation scheme. In the final section of the paper, they study the nucleolus of a big boss game, a special class of total clan games.
reviewed by: Chih Chang
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 1932772
zbMATH Keywords: clan games
zbMATH Keywords: total clan games
zbMATH Keywords: vertex player
zbMATH Keywords: big boss game
zbMATH Keywords: cooperative games
zbMATH Keywords: population monotonic allocation scheme
zbMATH Keywords: bi-monotonic allocation scheme
MaRDI profile type: Publication
OpenAlex ID: W3121268793
DOI: 10.1007/S001860200240
description: scientific article; zbMATH DE number 1932772