A fair rule in minimum cost spanning tree problems

From MaRDI portal
Publication:2469848

DOI10.1016/j.jet.2006.11.001zbMath1132.91366OpenAlexW2009698535MaRDI QIDQ2469848

Gustavo Bergantiños, Juan J. Vidal-Puga

Publication date: 11 February 2008

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2006.11.001




Related Items

A monotonic and merge-proof rule in minimum cost spanning tree situationsSharing sequential values in a networkCost allocation in asymmetric treesA discrete cost sharing model with technological cooperationA vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situationsFair cost-sharing methods for the minimum spanning tree gameAbsence-proofness: group stability beyond the coreThe Folk Rule for Minimum Cost Spanning Tree Problems with Multiple SourcesOn the set of extreme core allocations for minimal cost spanning tree problemsClique games: a family of games with coincidence between the nucleolus and the Shapley valueAllocating costs in set covering problemsTruth-telling and Nash equilibria in minimum cost spanning tree modelsDecentralized pricing in minimum cost spanning treesCharacterization of monotonic rules in minimum cost spanning tree problemsCharacterizations of the cycle-complete and folk solutions for minimum cost spanning tree problemsAlgorithms for computing the folk rule in minimum cost spanning tree problems with groupsStable and weakly additive cost sharing in shortest path problemsAn egalitarian solution to minimum cost spanning tree problemsA new stable and more responsive cost sharing solution for minimum cost spanning tree problemsA non-cooperative approach to the folk rule in minimum cost spanning tree problemsMinimum incoming cost rules for arborescencesBroadcasting revenue sharing after cancelling sports competitionsMinimum cost spanning tree problems as value sharing problemsAllocating extra revenues from broadcasting sports leaguesA cost allocation rule for \(k\)-hop minimum cost spanning tree problemsThe price of imperfect competition for a spanning networkMinimum cost spanning tree problems with indifferent agentsA characterization of optimistic weighted Shapley rules in minimum cost spanning tree problemsWeakly monotonic solutions for cooperative gamesCharacterizing rules in minimum cost spanning tree problemsLinking the Kar and folk solutions through a problem separation propertyMinimum cost arborescencesThe optimistic \(TU\) game in minimum cost spanning tree problemsThe degree and cost adjusted folk solution for minimum cost spanning tree gamesSharing the cost of maximum quality optimal spanning treesStrategic sharing of a costly networkA VALUE FOR PERT PROBLEMSCost additive rules in minimum cost spanning tree problems with multiple sourcesTrouble comes in threes: core stability in minimum cost connection networksMonotonicity in sharing the revenues from broadcasting sports leaguesHyperadditive games and applications to networks or matching problemsInvestigation on irreducible cost vectors in minimum cost arborescence problemsLoss allocation in energy transmission networks\textit{Folk} solution for simple minimum cost spanning tree problemsOn the core and nucleolus of directed acyclic graph gamesEfficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutionsA characterization of kruskal sharing rules for minimum cost spanning tree problemsMinimum cost spanning tree problems with groupsThe family of cost monotonic and cost additive rules in minimum cost spanning tree problemsMerge-proofness in minimum cost spanning tree problemsPricing traffic in a spanning networkOn obligation rules for minimum cost spanning tree problemsSharing a minimal cost spanning tree: beyond the folk solutionSequential contributions rules for minimum cost spanning tree problemsStability and fairness in the job scheduling problemConnection situations under uncertainty and cost monotonic solutionsA generalization of obligation rules for minimum cost spanning tree problemsThe folk solution and Boruvka's algorithm in minimum cost spanning tree problemsEmerging markets in the global economic network: real(ly) decoupling?Additivity in minimum cost spanning tree problemsA new rule for source connection problemsStable cost sharing in production allocation gamesRealizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanismsA cost sharing example in which subsidies are necessary for stabilityThe folk rule through a painting procedure for minimum cost spanning tree problems with multiple sourcesCOST SHARING IN NETWORKS: SOME OPEN QUESTIONSCHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMSCost-allocation problems for fuzzy agents in a fixed-tree networkRevenue Sharing in Airline Alliance NetworksAn axiomatic approach in minimum cost spanning tree problems with groups



Cites Work


This page was built for publication: A fair rule in minimum cost spanning tree problems