scientific article; zbMATH DE number 956794
From MaRDI portal
Publication:5687200
zbMath0861.90023MaRDI QIDQ5687200
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveynetworkscost allocationnetwork optimizationmatching modelsgraph theoretic conceptsminimal cost spanning tree networks
Programming involving graphs or networks (90C35) Noncooperative games (91A10) Communication networks in operations research (90B18) Cooperative games (91A12) Games involving graphs (91A43) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Trade models (91B60) Other game-theoretic models (91A40)
Related Items (23)
Axiomatization of the counting rule for cost-sharing with possibly redundant items ⋮ Cost allocation in asymmetric trees ⋮ Stable networks ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Decentralized pricing in minimum cost spanning trees ⋮ The river sharing problem with incomplete information ⋮ The price of imperfect competition for a spanning network ⋮ Cost Sharing in Production Economies ⋮ On how to allocate the fixed cost of transport systems ⋮ A fair rule in minimum cost spanning tree problems ⋮ Loss allocation in energy transmission networks ⋮ Axiomatization of the Shapley value on minimum cost spanning tree games ⋮ Pricing traffic in a spanning network ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ Computer science and decision theory ⋮ Threshold based discounting networks: the cost allocation provided by the nucleolus ⋮ Cost allocation protocols for supply contract design in network situations ⋮ Cost allocation in spanning network enterprises with stochastic connection costs. ⋮ Stable cost sharing in production allocation games ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ Revenue Sharing in Airline Alliance Networks ⋮ Stable lexicographic rules for shortest path games ⋮ Sharing a river.
This page was built for publication:
