The \(P\)-value for cost sharing in minimum

From MaRDI portal
Revision as of 02:48, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2487768

DOI10.1007/s11238-004-5635-5zbMath1127.91316OpenAlexW2048998458MaRDI QIDQ2487768

Henk Norde, Stefano Moretti, S. H. Tijs, Rodica Branzei

Publication date: 8 August 2005

Published in: Theory and Decision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11238-004-5635-5




Related Items

Some new results on generalized additive gamesA vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situationsAbsence-proofness: group stability beyond the coreThe Folk Rule for Minimum Cost Spanning Tree Problems with Multiple SourcesDecentralized 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 problemsAn overview of recent applications of game theory to bioinformaticsAn egalitarian solution to minimum cost spanning tree problemsA new stable and more responsive cost sharing solution for minimum cost spanning tree problemsMinimum cost spanning tree problems as value sharing problemsObligation rules for minimum cost spanning tree situations and their monotonicity propertiesThe price of imperfect competition for a spanning networkThe class of microarray games and the relevance index for genesLinking the Kar and folk solutions through a problem separation property``Optimistic weighted Shapley rules in minimum cost spanning tree problemsMinimum cost arborescencesThe optimistic \(TU\) game in minimum cost spanning tree problemsThe degree and cost adjusted folk solution for minimum cost spanning tree gamesCost additive rules in minimum cost spanning tree problems with multiple sourcesA fair rule in minimum cost spanning tree problemsInvestigation on irreducible cost vectors in minimum cost arborescence 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 problemsCongestion network problems and related gamesOn obligation rules for minimum cost spanning tree problemsSharing a minimal cost spanning tree: beyond the folk solutionSequential contributions rules for minimum cost spanning tree problemsConnection 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 problemsAdditivity in minimum cost spanning tree problemsA new rule for source connection problemsCost allocation protocols for supply contract design in network situationsRealizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanismsGame theory applied to gene expression analysisThe 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 PROBLEMSAn axiomatic approach in minimum cost spanning tree problems with groupsOn Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations



Cites Work