The nucleon of cooperative games and an algorithm for matching games

DOI10.1007/BF02592089zbMath0920.90142MaRDI QIDQ1290660

Walter Kern, Winfried Hochstättler, Ulrich Faigle, Sándor P. Fekete

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

corenucleolusnucleonmatching gamesnonnegative cooperative \(n\)-person transferable utility games

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (8)

Population monotonicity in matching games ⋮ Computing solutions for matching games ⋮ Simple games versus weighted voting games: bounding the critical threshold value ⋮ Efficient stabilization of cooperative matching games ⋮ On the vertices of the \(k\)-additive core ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ The general graph matching game: approximate core ⋮ The nucleolus is well-posed

Cites Work

• Monge sequences and a simple assignment algorithm
• Generalized polymatroids and submodular flows
• A Monge property for the \(d\)-dimensional transportation problem
• Perspectives of Monge properties in optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The nucleon of cooperative games and an algorithm for matching games