Cost Allocation in Combinatorial Optimization Games

Yannis Marinakis (), Athanasios Migdalas () and Panos M. Pardalos ()
Additional contact information
Yannis Marinakis: Technical University of Crete
Athanasios Migdalas: Technical University of Crete
Panos M. Pardalos: University of Florida

A chapter in Pareto Optimality, Game Theory And Equilibria, 2008, pp 217-247 from Springer

Abstract: 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.

Keywords: cost allocation; combinatorial optimization games (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-77247-9_9

Ordering information: This item can be ordered from
http://www.springer.com/9780387772479

DOI: 10.1007/978-0-387-77247-9_9

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().