Algorithmic Cooperative Game Theory

DOI10.1007/978-0-387-77247-9_7zbMath1152.91322OpenAlexW2112461995MaRDI QIDQ3528695

Qizhi Fang, Xiaotie Deng

Publication date: 17 October 2008

Published in: Pareto Optimality, Game Theory And Equilibria (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-77247-9_7

zbMATH Keywords

computational complexitycorecooperative gamelinear programnucleolusLP duality

Mathematics Subject Classification ID

Noncooperative games (91A10) Linear programming (90C05)

Related Items (9)

On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ A Solution Concept Related to “Bounded Rationality” for some Two-Echelon Models ⋮ Unnamed Item ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network strength games: the core and the nucleolus ⋮ Social exchange networks with distant bargaining ⋮ Gain-sharing in urban consolidation centers ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ Computing Shapley values in the plane

This page was built for publication: Algorithmic Cooperative Game Theory