Cost allocation in combinatorial optimization games
- Μαρινακης Ιωαννης(http://users.isc.tuc.gr/~imarinakis)
- Marinakis Ioannis(http://users.isc.tuc.gr/~imarinakis)
- Μυγδαλας Αθανασιος(http://users.isc.tuc.gr/~amygdalas)
- Mygdalas Athanasios(http://users.isc.tuc.gr/~amygdalas)
- Pardalos, Panos M., 1954-(http://viaf.org/viaf/108896172)
DOI Publisher
Springer Science and Business Media LLCAbstract
Summarization: Cooperative game theory is concerned primarily with groups of players who coordinate their actions and pool their winnings. One of the main concerns is how to divide the extra earnings (or cost savings) among the members of the coalitions. Thus a number of solution concepts for cooperative games have been proposed. In this chapter, a selection of basic notions and solution concepts for cooperative games are presented and analyzed in detail. The paper is particularly concerned with cost allocation methods in problems that arise from the field of combinatorial (discrete) optimization.Appearing in: Pareto Optimality, Game Theory And Equilibri
Add to ORKG