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

Cost allocation in spanning network enterprises with stochastic connection costs.

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

DOI10.1016/S0899-8256(02)00508-0zbMath1045.91006MaRDI QIDQ1811556

Jeroen Suijs

Publication date: 17 June 2003

Published in: Games and Economic Behavior (Search for Journal in Brave)


zbMATH Keywords

coreBird allocationstochastic cooperative gamesstochastic spanning tree games


Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15)


Related Items

Operations research games: A survey. (With comments and rejoinder) ⋮ Congestion network problems and related games ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ On the grey obligation rules



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A note on two problems in connexion with graphs
  • Stochastic cooperative games: Superadditivity, convexity, and certainty equivalents
  • Minimum cost spanning tree games
  • Cost allocation for a spanning tree
  • On cost allocation for a spanning tree: A game theoretic approach
  • Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree


This page was built for publication: Cost allocation in spanning network enterprises with stochastic connection costs.

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