A new rule for source connection problems
From MaRDI portal
Publication:2514781
DOI10.1016/j.ejor.2013.09.047zbMath1304.91041MaRDI QIDQ2514781
Natividad Llorca, María Gómez-Rúa, Gustavo Bergantiños, Joaquín Sánchez-Soriano, Manuel A. Pulido
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.09.047
91A12: Cooperative games
91A43: Games involving graphs
91A80: Applications of game theory
90B10: Deterministic network models in operations research
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
Algorithms for computing the folk rule in minimum cost spanning tree problems with groups, Cost allocation in asymmetric trees, A solution concept for network games: the role of multilateral interactions, Horizontal cooperation in a multimodal public transport system: the profit allocation problem, Axiomatization of the counting rule for cost-sharing with possibly redundant items, Allocating costs in set covering problems, One-way and two-way cost allocation in hub network problems, Cost additive rules in minimum cost spanning tree problems with multiple sources, On how to allocate the fixed cost of transport systems, A characterization of the folk rule for multi-source minimal cost spanning tree problems, The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A cost allocation rule for \(k\)-hop minimum cost spanning tree problems
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- Equal-need sharing of a network under connectivity constraints
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- Additivity in minimum cost spanning tree problems
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- Sharing the cost of a network: core and core allocations
- Minimum cost spanning tree games and population monotonic allocation schemes.
- The kernel/nucleolus of a standard tree game
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- The optimistic \(TU\) game in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The \(P\)-value for cost sharing in minimum
- Approximating \(k\)-hop minimum-spanning trees
- Congestion network problems and related games
- A new relaxation method for the generalized minimum spanning tree problem
- Approximate stable solutions in infinite tree problems
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
