Connection problems in mountains and monotonic allocation schemes. (Q699516): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On cost allocation for a spanning tree: A game theoretic approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5817872 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5688121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cost allocation for steiner trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum cost spanning tree games and population monotonic allocation schemes. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Population monotonic allocation schemes for cooperative games with transferable utility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4365142 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotonic allocation schemes in clan games / rank | |||
Normal rank |
Revision as of 16:30, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Connection problems in mountains and monotonic allocation schemes. |
scientific article |
Statements
Connection problems in mountains and monotonic allocation schemes. (English)
0 references
2002
0 references
A specific directed minimum cost spanning tree problems is given. Its related cost sharing problem is tackled by considering the corresponding cost game. The core of the class of games has a simple structure and each core element can be extended to a PMAS.
0 references
minimum and spanning tree problems
0 references
PMAS
0 references
core
0 references
0 references