Efficiency decomposition in a three-stage network structure: cooperative DEA, Nash bargaining game models and conic relaxations

DOI10.1051/RO/2021170MaRDI QIDQ5034765zbMATH OpenOpenAlexFDO

Authors Narges Torabi Golsefid, Maziar Salahi

Publication date 21 February 2022

Published in RAIRO - Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ro/2021170

zbMATH Keywords

data envelopment analysisNash bargaining gamecooperative modelsconic relaxationthree-stage models

Mathematics Subject Classification ID

Convex programming (90C25) Management decision making, including multiple objectives (90B50) Noncooperative games (91A10) Production models (90B30)

Recommendations

• A bargaining game model for measuring performance of two-stage network structures
• DEA models for two-stage processes: Game approach and efficiency decomposition
• DEA models for parallel systems: game-theoretic approaches
• Dynamic efficiency measurement and decomposition for a network system with slacks-based measures
• Network DEA: additive efficiency decomposition

Cited in

(2)

• An SOCP approach to a two-stage network DEA with feedbacks and shared resources
• Additive slack-based measure for a two-stage structure with shared inputs and undesirable feedback

This page was built for publication: Efficiency decomposition in a three-stage network structure: cooperative DEA, Nash bargaining game models and conic relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034765)