Two-bound core games and the nucleolus

DOI10.1007/S10479-022-04949-0zbMATH Open1545.91013MaRDI QIDQ6573313FDOQ6573313

Authors: Doudou Gong, Bas Dietzenbacher, Hans Peters 

Publication date: 16 July 2024

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

Recommendations

• Reduced two-bound core games
• The core cover in relation to the nucleolus and the Weber set
• Publication:3028756
• Upper and lower bounds of the kernel and nucleolus
• Publication:3032104

zbMATH Keywords

nucleolusTalmud ruletwo-bound core games

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites Work

• Game theoretic analysis of a bankruptcy problem from the Talmud
• A problem of rights arbitration from the Talmud
• A geometric characterisation of the compromise value
• A quadratic programming model for product configuration optimization
• The Nucleolus of a Characteristic Function Game
• Cores of convex games
• Title not available (Why is that?)
• Clan games
• Title not available (Why is that?)
• The core cover in relation to the nucleolus and the Weber set
• Title not available (Why is that?)
• Compromise solutions based on bankruptcy
• Properties of 1-convex \(n\)-person games
• Bankruptcy games with nontransferable utility
• Extensive coverings and exact core bounds

Cited In (2)

• An algorithm to compute the average-of-awards rule for claims problems with an application to the allocation of \(\mathrm{CO}_2\) emissions
• One-bound core games

This page was built for publication: Two-bound core games and the nucleolus

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