On ordered weighted averaging aggregation operators in multicriteria decisionmaking
IEEE Transactions on Systems, Man and Cybernetics
Applications of approximation algorithms to cooperative games
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Hardness results for multicast cost sharing
Theoretical Computer Science
Fair Game-Theoretic Resource Management in Dedicated Grids
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
| Hi-index | 0.00 |
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.