Cooperative and axiomatic approaches to the knapsack allocation problem

R. Pablo Arribillaga and Gustavo Bergantiños

MPRA Paper from University Library of Munich, Germany

Abstract: In the knapsack problem a group of agents want to fill a knapsack with several goods. Two issues should be considered. Firstly, to decide optimally the goods selected for the knapsack, which has been studied in many papers. Secondly, to divide the total revenue among the agents, which has been studied in few papers (including this one). We assign to each knapsack problem several cooperative games. For some of them we prove that the core is non-empty. Later, we follow the axiomatic approach. We propose two rules. The first one is based on the optimal solution of the knapsack problem. The second one is the Shapley value of the so called optimistic game. We offer axiomatic characterizations of both rules.

Keywords: Knapsack problem; axiomatic; cooperative games (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Date: 2019-01-25
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://mpra.ub.uni-muenchen.de/91719/1/MPRA_paper_91719.pdf original version (application/pdf)

Related works:
Journal Article: Cooperative and axiomatic approaches to the knapsack allocation problem (2022)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pra:mprapa:91719

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 ().