An efficient and fair solution for communication graph games (Q2440450): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2116263596 / 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: Coincidence of and collinearity between game theoretic solutions / 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 | |||
Revision as of 11:20, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient and fair solution for communication graph games |
scientific article |
Statements
An efficient and fair solution for communication graph games (English)
0 references
18 March 2014
0 references
TU game
0 references
communication graph
0 references
Myerson value
0 references
