G. Bergantiños Cid, P. Arribillaga
In the knapsack problem a group of agents want to fill a knapsack with several objects. Since preferences are heterogeneous, two issues should be considered. Firstly, to decide optimally the objects selected for the knapsack. This issue has been studied in many papers. Secondly, to divide the total revenue among the agents. Our paper is one of the few devoted his issue. We associate to each knapsack problem a cooperative game and we prove that the core is non-empty. Later, we follow the axiomatic approach. We propose two rules. The first one is based in the optimal solution of the knapsack problem and it is an element of the core. Teh second one is the Shapley value of the so called optimistic game.
Palabras clave: cooperative games, knapsack problem, axiomatic approach
Programado
X03.4 Grupo de Teoría de Juegos II
7 de septiembre de 2016 10:00
Aula 21.07
