Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Supportability of network cost functions

From MaRDI portal
Publication:1197768
Jump to:navigation, search

DOI10.1007/BF02094320zbMath0762.90103MaRDI QIDQ1197768

William W. Sharkey

Publication date: 16 January 1993

Published in: Annals of Operations Research (Search for Journal in Brave)


zbMATH Keywords

network gamescoalitional stabilityminimal cost network


Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Deterministic network models in operations research (90B10)


Related Items (3)

Cost monotonicity, consistency and minimum cost spanning tree games ⋮ On a cost allocation problem arising from a capacitated concentrator covering problem ⋮ Adaptive generalisation



Cites Work

  • Supportable cost functions for the multiproduct firm
  • On cost allocation in communication networks
  • Minimum cost spanning tree games
  • On cost allocation for a spanning tree: A game theoretic approach
  • Cost allocation for steiner trees
  • Steiner Minimal Trees


This page was built for publication: Supportability of network cost functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1197768&oldid=13256041"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki