The order of criticality of a player in a simple game and two indices inspired by the reasoning à la Shapley and à la Banzhaf were introduced in two previous papers [3] and [4], respectively, mainly having in mind voting situations. Here, we devote our attention to graph connection games, and to the computation of the order of criticality of a player. The indices introduced in [4] may be used as centrality measures of the edges in preserving the connection of a graph.
Dall'Aglio, Marco; Fragnelli, Vito; Moretti, Stefano. (2019). Orders of Criticality in Graph Connection Games. In Ngoc Thanh Nguyen, Ryszard Kowalczyk, Jacek Mercik, Anna Motylska-Kuźma (Eds.), Transactions on Computational Collective Intelligence XXXIV (pp. 35-46). Springer. Isbn: 9783662605547. Isbn: 9783662605554. Doi: 10.1007/978-3-662-60555-4_3.
Orders of Criticality in Graph Connection Games
Dall’Aglio, MarcoWriting – Original Draft Preparation
;
2019
Abstract
The order of criticality of a player in a simple game and two indices inspired by the reasoning à la Shapley and à la Banzhaf were introduced in two previous papers [3] and [4], respectively, mainly having in mind voting situations. Here, we devote our attention to graph connection games, and to the computation of the order of criticality of a player. The indices introduced in [4] may be used as centrality measures of the edges in preserving the connection of a graph.
| File | Dimensione | Formato | |
|---|---|---|---|
|
DallAglio2019_Chapter_OrdersOfCriticalityInGraphConn.pdf
Solo gestori archivio
Descrizione: Articolo pubblicato
Tipologia:
Versione dell'editore
Licenza:
DRM (Digital rights management) non definiti
Dimensione
250.76 kB
Formato
Adobe PDF
|
250.76 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
