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

Sharing the cost of a network: core and core allocations

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

DOI10.1007/s001820200099zbMath1083.91021OpenAlexW2170563224MaRDI QIDQ1414428

D. Massart

Publication date: 23 November 2003

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/ws/files/489949/27804_19816.pdf


zbMATH Keywords

corecost sharingconstrained egalitarianismtree gamesCooperative game theory


Mathematics Subject Classification ID

Trees (05C05) Cooperative games (91A12) Deterministic network models in operations research (90B10)


Related Items (9)

Operations research games: A survey. (With comments and rejoinder) ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ Sharing cost of network among users with differentiated willingness to pay ⋮ Cost Sharing in Production Economies ⋮ Equal-need sharing of a network under connectivity constraints ⋮ A new rule for source connection problems ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Hierarchical constrained egalitarianism in TU-games.




This page was built for publication: Sharing the cost of a network: core and core allocations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1414428&oldid=13578184"
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 16:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki