Comparative statics of minimum-cost-spanning-tree games

DOI10.1016/J.GEB.2025.03.005MaRDI QIDQ6997957zbMATH OpenFDO

Authors Zhibin Tan, Cao Zhigang, Zhengxing Zou

Publication date 11 April 2025

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.GEB.2025.03.005

zbMATH Keywords

comparative staticscooperative gamescoreexact coversminimum-cost-spanning-tree games

Mathematics Subject Classification ID

Cooperative games (91A12)

Cites work

• A fair rule in minimum cost spanning tree problems
• A generalized linear production model: A unifying model
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems
• An efficient characterization of submodular spanning tree games
• Assignment games with stable core
• Assignment markets with the same core
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Balancedness conditions for exact games
• Buyer-seller exactness in the assignment game
• Comparative cooperative game theory
• Cores of convex games
• Cores of exact games. I
• Cost allocation for a spanning tree
• Cost monotonicity, consistency and minimum cost spanning tree games
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
• Extensive coverings and exact core bounds
• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• Minimal exact balancedness
• Minimum cost arborescences
• Minimum cost connection networks: truth-telling and implementation
• Minimum cost spanning tree games
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Minimum cost spanning tree problems as value sharing problems
• Minimum cost spanning tree problems with indifferent agents
• On cost allocation for a spanning tree: A game theoretic approach
• On the core and nucleolus of minimum cost spanning tree games
• On the core of information graph games
• On the core of network synthesis games
• On the set of extreme core allocations for minimal cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• Stable cores in information graph games
• The degree and cost adjusted folk solution for minimum cost spanning tree games
• The irreducible Core of a minimum cost spanning tree game
• Total balancedness condition for Steiner tree games.
• Zur allgemeinen Kurventheorie.

This page was built for publication: Comparative statics of minimum-cost-spanning-tree games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997957)