Shapley Value Based Allocation for Multi-objective Cooperative Problems

DOI10.1007/978-3-319-89920-6_3zbMath1397.91043OpenAlexW2804009224MaRDI QIDQ4685725

I. Kozeletskyi

Publication date: 9 October 2018

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_3

zbMATH Keywords

multi-objective optimizationShapley valuetraveling salesman problemcooperative game theory

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Cooperative games (91A12)

Related Items

Carrier collaboration with the simultaneous presence of transferable and non-transferable utilities

Cites Work

• Core-based cost allocation in the cooperative traveling salesman problem
• On computational methods for solutions of multiobjective linear production programming games
• Multi-criteria minimum cost spanning tree games
• Set-valued TU-games
• Computing the NTU-Shapley value of NTU-games defined by multiple objective linear programs
• Unnamed Item
• Unnamed Item