Algorithmic Cooperative Game Theory

Xiaotie Deng () and Qizhi Fang ()
Additional contact information
Xiaotie Deng: City University of Hong Kong
Qizhi Fang: Ocean University of China

A chapter in Pareto Optimality, Game Theory And Equilibria, 2008, pp 159-185 from Springer

Abstract: In this treatise, we survey some progress in cooperative game theory, in particular those involved with algorithmic and computational complexity issues. Central to these results is the linear program duality characterization of the core for some combinatorial optimization games. We highlight the linear and integer programming techniques and computational complexity approach applied to the core and the Nucleolus for various kinds of games, such as linear production game, flow game, minimum cost spanning tree game, packing and covering games, matching game, and facility location game.

Keywords: cooperative game; core; nucleolus; linear program; LP duality; computational complexity; NP-hard (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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_7

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

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

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 ().