Total balancedness condition for Steiner tree games.

DOI10.1016/S0166-218X(02)00388-8zbMath1045.91004OpenAlexW2011951540MaRDI QIDQ1811075

Xiaotie Deng, Qizhi Fang, Mao-cheng Cai

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00388-8

zbMATH Keywords

cooperative gamescoreNP-hardSteiner treetotal balancedness

Mathematics Subject Classification ID

Cooperative games (91A12) Games in extensive form (91A18)

Related Items (1)

Traveling salesman games with the Monge property

Cites Work

• On the complexity of testing membership in the core of min-cost spanning tree games
• Totally balanced combinatorial optimization games
• Spanning network games.
• Minimum cost spanning tree games
• Totally Balanced Games and Games of Flow
• On the core of linear production games
• On cost allocation for a spanning tree: A game theoretic approach
• Cost allocation for steiner trees
• On the Complexity of Cooperative Solution Concepts
• Algorithmic Aspects of the Core of Combinatorial Optimization Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total balancedness condition for Steiner tree games.