.png){kind=icon}
.png){kind=icon}
Return
Computing multiperiod efficiency using dominance networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-021-04421-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dominance Network (DN) analysis has been proposed to assess the efficiency of a set of operating units (OUs) that consume inputs to produce outputs. In a DN, the nodes represent OUs and the arcs correspond to dominance relationships (DR) between them. So far, this analysis has been applied in static scenarios where the OUs belong to the same time period. In this paper, the methodology is extended to the case in which the input and output data refer to multiple time periods tracking the performance evolution of each OU. The proposed Temporal Dominance Network (TDN) contains a node for each OU in each time period. TDN is a weighted directed acyclic graph. There exist contemporaneous DR (between nodes that correspond to the same time period) as well as non-contemporaneous DR (between nodes that correspond to different time periods). The union of these two types of DR defines the TDN. All these DR are transitive, which allows us to represent the TDN by its corresponding skeleton. Various filters and node layouts that can be used to help visualise the TDN are proposed. In addition, a number of network metrics are used to characterise the efficiency of the various OUs in the different periods as well as the corresponding productivity change between any two periods.
Keywords:
Dominance relationships
Complex network analysis
Multiperiod data
Efficiency
Productivity change
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W