Computing α-efficient cost allocations for unbalanced games

Abstract

We consider a network of agents involved in a common project. Resulting project common cost allocation problem can be modeled as a cooperative game with empty core possible. From social point of view, achievement of subsidy-free allocation may play important role, even at a cost of allocation efficiency. Subsidy-free and α-efficient allocation can be obtained by solving linear programme MASIT. However, to find an unique MASIT solution we use notion of equitable rational preference relation and apply column generation technique. We also show, that there are interesting cases of unbalanced games, and for one of them, TP-game, we present numerical results of our approach. © 2010 Springer-Verlag.