Generalized minimum spanning tree games
From MaRDI portal
Publication:286691
DOI10.1007/s13675-015-0042-yzbMath1337.91030OpenAlexW1843403144MaRDI QIDQ286691
Tri-Dung Nguyen, Phuoc Hoang Le, Tolga Bektaş
Publication date: 25 May 2016
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/379367/1/EJCO%252027-05.pdf
Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Cooperative game theory and inventory management
- Cost monotonicity, consistency and minimum cost spanning tree games
- Cost allocation in collaborative forest transportation
- Sharing a minimal cost spanning tree: beyond the folk solution
- The Shapley value for cooperative games under precedence constraints
- Class Steiner trees and VLSI-design
- On the complexity of testing membership in the core of min-cost spanning tree games
- Generalized spanning trees
- An axiomatic approach in minimum cost spanning tree problems with groups
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Heuristic Search for the Generalized Minimum Spanning Tree Problem
- Computational Aspects of Cooperative Game Theory
- Minimum cost spanning tree games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
- Graphs and Cooperation in Games
- On the generalized minimum spanning tree problem
- Game Theory
- The core of games on ordered structures and graphs
This page was built for publication: Generalized minimum spanning tree games
