A network-based approach for increasing discrimination in data envelopment analysis

Abstract

Data envelopment analysis (DEA) is known to produce more than one efficient decision-making unit (DMU). This paper proposes a network-based approach for further increasing discrimination among these efficient DMUs. The approach treats the system under study as a directed and weighted network in which nodes represent DMUs and the direction and strength of the links represent the relative relationship among DMUs. In constructing the network, the observed node is set to point to its referent DMUs as suggested by DEA. The corresponding lambda values for these referent DMUs are taken as the strength of the network link. The network is weaved by not only the full input/output model, but also by models of all possible input/output combinations. Incorporating these models into the system basically introduces the merits of each DMU under various situations into the system and thus provides the key information for further discrimination. Once the network is constructed, the centrality concept commonly used in social network analysis—specifically, eigenvector centrality—is employed to rank the efficient DMUs. The network-based approach tends to rank high the DMUs that are not specialized and have balanced strengths.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 53 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.