Computing the nucleolus of some combinatorially-structured games.
type: Item
instance of: scholarly article
title: Computing the nucleolus of some combinatorially-structured games.
zbMATH Open document ID: 1034.91021
author: J. Kuipers
author: Tamás Solymosi
author: Harry Aarts
published in: Mathematical Programming. Series A. Series B
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A12
zbMATH DE Number: 1538618
MaRDI profile type: Publication
DOI: 10.1007/S101070000109
Recommended article: Computing the nucleolus of cyclic permutation games
Recommended article: On the computation of the nucleolus of a cooperative game
Recommended article: On computing the nucleolus of a balanced connected game
Recommended article: A procedure to compute the nucleolus of the assignment game
Recommended article: The complexity of the nucleolus in compact games
Recommended article: Q3840271
Recommended article: An algorithm for finding the nucleolus of assignment games
Recommended article: A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
Recommended article: On the complexity of nucleolus computation for bipartite \(b\)-matching games
Recommended article: Q3481525
description: scientific article; zbMATH DE number 1538618