Título de la charla: A cooperative and axiomatic approach to the knapsack allocation problem
Expositor: Pablo Arribillaga
Resumen: 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 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. The second one is the Shapley value of the so called optimistic game.