On Computing the Nucleolus of a Balanced Connected Game

DOI10.1287/moor.23.4.983zbMath0985.91005OpenAlexW2063462490MaRDI QIDQ2757577

Harry Aarts, Tamás Solymosi, Theo S. H. Driessen

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.4.983

zbMATH Keywords

algorithmcorebalancednucleolusconnected games

Mathematics Subject Classification ID

Cooperative games (91A12) (n)-person games, (n>2) (91A06)

Related Items (4)

Operations research games: A survey. (With comments and rejoinder) ⋮ Core stability in chain-component additive games ⋮ The Complexity of the Nucleolus in Compact Games ⋮ On the nucleolus of neighbor games

This page was built for publication: On Computing the Nucleolus of a Balanced Connected Game