An inductive method for constructing mimmal balanced collections of finite sets

DOI10.1002/NAV.3800120203MaRDI QIDQ5511873zbMATH OpenOpenAlexFDO

Authors Bezalel Peleg

Publication date 1965

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800120203

zbMATH Keywords

operations research

Cited in

(14)

• On the regions of linearity for the nucleolus and their computation
• Quasi-cores in bargaining sets
• Sharing loading costs for multi compartment vehicles
• On cores and indivisibility
• Liability games
• Perfect graphs, kernels, and cores of cooperative games
• Sequential legislative lobbying
• Quantum entanglement, indistinguishability, and the absent-minded driver's problem
• The kernel and bargaining set for convex games
• A note on harmonious families
• Characterization of TU games with stable cores by nested balancedness
• Core stability of the Shapley value for cooperative games
• The assignment problem as a cooperative game
• Minimal exact balancedness

This page was built for publication: An inductive method for constructing mimmal balanced collections of finite sets

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