On cost allocation in communication networks

DOI10.1002/net.3230200207zbMath0689.90080OpenAlexW2116337599MaRDI QIDQ3032107

Daniel Granot, Mehran Hojati

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200207

zbMATH Keywords

Shapley valuecost allocationcommunication networknucleolusminimum-cost networknonsimultaneous network synthesis problemsimultaneous network synthesis problemsynthesis game

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Cooperative games (91A12) Deterministic network models in operations research (90B10) Other game-theoretic models (91A40)

Related Items (6)

ON THE SUPERMODULARITY OF HOMOGENEOUS OLIGOPOLY GAMES ⋮ Supportability of network cost functions ⋮ Threshold based discounting networks: the cost allocation provided by the nucleolus ⋮ On the core of network synthesis games ⋮ A necessary and sufficient condition for the convexity in oligopoly games ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS

Cites Work

• Unnamed Item

This page was built for publication: On cost allocation in communication networks