On the core and nucleolus of minimum cost spanning tree games

From MaRDI portal
Publication:3329250

DOI10.1007/BF02592000zbMath0541.90099OpenAlexW2007491585MaRDI QIDQ3329250

Gur Huberman, Daniel Granot

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592000




Related Items (54)

A core-allocation for a network restricted linear production gameSocial enterprise tree network gamesOn the core of information graph gamesA note on Steiner tree gamesTarification par des jeux Coopératifs avec Demandes ÉlastiquesA vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situationsOperations research games: A survey. (With comments and rejoinder)On the core of the minimum cost Steiner tree game in networksFinding the nucleoli of large cooperative gamesSharing the cost of multicast transmissions in wireless networksOn the set of extreme core allocations for minimal cost spanning tree problemsA generalized linear production model: A unifying modelThe kernel/nucleolus of a standard tree gameOn the core of a traveling salesman cost allocation gameComputation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial casesAveraged dual solution for linear production games and its characterizationA non-cooperative approach to the folk rule in minimum cost spanning tree problemsCooperative location games based on the minimum diameter spanning Steiner subgraph problemCooperative networks games with elastic demandsA cost allocation rule for \(k\)-hop minimum cost spanning tree problemsA characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems``Optimistic weighted Shapley rules in minimum cost spanning tree problemsThe 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 treesCost Sharing in Production EconomiesSpanning-Tree Games.Strategic sharing of a costly networkA fair rule in minimum cost spanning tree problemsOn the core and nucleolus of directed acyclic graph gamesOn the core of cost-revenue games: minimum cost spanning tree games with revenuesA characterization of kruskal sharing rules for minimum cost spanning tree problemsAxiomatization of the Shapley value on minimum cost spanning tree gamesMerge-proofness in minimum cost spanning tree problemsCost monotonicity, consistency and minimum cost spanning tree gamesPricing 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 problemsA cooperative location game based on the 1-center location problemThe fairest core in cooperative games with transferable utilitiesNoncooperative cost spanning tree games with budget restrictionsNetwork strength games: the core and the nucleolusOn the core of network synthesis gamesExtended cooperative networks gamesA non-cooperative game theory approach to cost sharing in networksNetwork flow problems and permutationally concave gamesCOST 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 networkThree-person spanning tree gamesThe irreducible Core of a minimum cost spanning tree gameCooperative interval games: mountain situations with interval dataOptimal equilibria in the non-cooperative game associated with cost spanning tree problem



Cites Work


This page was built for publication: On the core and nucleolus of minimum cost spanning tree games