On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Efficient extensions of the Myerson value / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A matrix approach to TU games with coalition and communication structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs and Cooperation in Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5817870 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient and fair solution for communication graph games / rank | |||
Normal rank |
Latest revision as of 11:26, 16 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the existence of efficient and fair extensions of communication values for connected graphs |
scientific article |
Statements
On the existence of efficient and fair extensions of communication values for connected graphs (English)
0 references
29 August 2018
0 references
communication graph
0 references
fairness
0 references
efficiency
0 references
efficient extension
0 references
fair extension
0 references
myerson value
0 references