Allocating costs in set covering problems
Manuel Pulido and
MPRA Paper from University Library of Munich, Germany
This paper deals with the problem of allocating costs in set covering situations. In particular, we focus on set covering situations where the optimal covering is given in advance. Thus, we take into account only the facilities that have to be opened and look for rules distributing their cost. We define a cooperative game and study the core and the nucleolus. We also introduce two new rules: the equal split rule on facilities and the serial rule. We axiomatically characterize the core, the nucleolus, and the two rules. Finally, we study several monotonicity properties of the rules.
Keywords: set covering problems; cost sharing rules; cooperative games (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
https://mpra.ub.uni-muenchen.de/92659/1/MPRA_paper_92659.pdf original version (application/pdf)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:92659
Access Statistics for this paper
More papers in MPRA Paper from University Library of Munich, Germany Ludwigstraße 33, D-80539 Munich, Germany. Contact information at EDIRC.
Bibliographic data for series maintained by Joachim Winter ().