On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.econlet.2016.07.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2476384752 / rank | |||
Normal rank | |||
Revision as of 17:43, 21 March 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
