The nucleon of cooperative games and an algorithm for matching games

DOI10.1007/BF02592089zbMATH Open0920.90142MaRDI QIDQ1290660FDOQ1290660

Authors: U. Faigle, Walter Kern, Winfried. Hochstättler, Sándor P. Fekete 

Publication date: 3 June 1999

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

Recommendations

• scientific article
• On the computation of the nucleolus of a cooperative game
• scientific article; zbMATH DE number 1187071
• Computing the nucleolus of weighted cooperative matching games in polynomial time
• Computing the nucleolus of weighted cooperative matching games in polynomial time
• On finding the nucleolus of an \(n\)-person cooperative game
• Finding and verifying the nucleolus of cooperative games
• scientific article; zbMATH DE number 6007910
• scientific article
• The general nucleolus of \(n\)-person cooperative games

zbMATH Keywords

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

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized polymatroids and submodular flows
• Perspectives of Monge properties in optimization
• A Monge property for the \(d\)-dimensional transportation problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Monge sequences and a simple assignment algorithm

Cited In (15)

• Simple games versus weighted voting games: bounding the critical threshold value
• An algorithm for finding the nucleolus of assignment games
• A note on the nucleolus of assignment games.
• The nucleolus is well-posed
• Title not available (Why is that?)
• Clique games: a family of games with coincidence between the nucleolus and the Shapley value
• The complexity of matching games: a survey
• On the vertices of the \(k\)-additive core
• Population monotonicity in matching games
• Computing the nucleolus of weighted cooperative matching games in polynomial time
• Approximate core allocations for edge cover games
• On the nucleolus of neighbor games
• The general graph matching game: approximate core
• Computing solutions for matching games
• Efficient stabilization of cooperative matching games

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290660)