Two-bound core games and the nucleolus
From MaRDI portal
Publication:6573313
DOI10.1007/S10479-022-04949-0zbMATH Open1545.91013MaRDI QIDQ6573313
Doudou Gong, Bas Dietzenbacher, Hans Peters
Publication date: 16 July 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Properties of 1-convex \(n\)-person games
- Game theoretic analysis of a bankruptcy problem from the Talmud
- A problem of rights arbitration from the Talmud
- Clan games
- Extensive coverings and exact core bounds
- Bankruptcy games with nontransferable utility
- Compromise solutions based on bankruptcy
- Cores of convex games
- A geometric characterisation of the compromise value
- The core cover in relation to the nucleolus and the Weber set
- A quadratic programming model for product configuration optimization
- The Nucleolus of a Characteristic Function Game
Related Items (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)
