Cooperative and axiomatic approaches to the knapsack allocation problem

DOI10.1007/s10479-021-04315-6zbMath1505.91032OpenAlexW3207580250MaRDI QIDQ2095938

R. Pablo Arribillaga, Gustavo Bergantiños

Publication date: 15 November 2022

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

Full work available at URL: https://doi.org/10.1007/s10479-021-04315-6

zbMATH Keywords

cooperative gamesknapsack problemaxiomatic approach

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cost allocation: The traveling salesman, bin packing, and the knapsack
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• Conference structures and fair allocation rules
• A problem of rights arbitration from the Talmud
• Operations research games: A survey. (With comments and rejoinder)
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
• The Talmud rule and the securement of agents' awards.
• New trends in exact algorithms for the \(0-1\) knapsack problem
• The nonlinear knapsack problem - algorithms and applications
• Knapsack cost sharing
• Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update
• The optimistic \(TU\) game in minimum cost spanning tree problems
• The Shapley Value in Knapsack Budgeted Games
• The Bargaining Problem

This page was built for publication: Cooperative and axiomatic approaches to the knapsack allocation problem