Average lexicographic efficiency for data envelopment analysis
•A new efficiency evaluation approach is proposed for Data Envelopment Analysis.•This approach is based on lexicographical evaluations of decision-making units.•It provides a unique evaluation of the efficiency of each decision-making unit.•It is fair in some sense as the Shapley value for cooperati...
Gespeichert in:
Veröffentlicht in: | Omega (Oxford) 2018-01, Vol.74, p.82-91 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 91 |
---|---|
container_issue | |
container_start_page | 82 |
container_title | Omega (Oxford) |
container_volume | 74 |
creator | Chen, Haoxun |
description | •A new efficiency evaluation approach is proposed for Data Envelopment Analysis.•This approach is based on lexicographical evaluations of decision-making units.•It provides a unique evaluation of the efficiency of each decision-making unit.•It is fair in some sense as the Shapley value for cooperative games.•An efficient algorithm for calculating the new efficiency measure is proposed.
Cross evaluation measures the efficiency of each DMU based on both its self-evaluation and the peer evaluations of all other DMUs. One problem of cross evaluation is that the cross efficacy scores may be not unique because of the non-uniqueness of the optimal weights of the conventional DEA model used. We propose a new approach for measuring the efficiencies of DMUs based on their lexicographical evaluations. It does not require a common set of weights for all DMUs but can provide a unique efficiency score for each DMU. In the approach, the efficiencies of the DMUs are lexicographically evaluated for each of their possible orders, subject to the constraints that the efficiencies of all DMUs already evaluated cannot be changed. The average lexicographic efficiency of each DMU is then obtained by averaging its lexicographic efficiencies. This efficiency has some desirable properties. Since all DMUs have an equal right to claim a position in the lexicographic evaluation, it is fair in some sense, as the Shapley value for payoff allocation in cooperative games. A procedure for efficiently computing the lexicographic efficiency is proposed. Numerical results on two instances demonstrate the vitality of our approach and the efficiency of its computation procedure. |
doi_str_mv | 10.1016/j.omega.2017.01.008 |
format | Article |
fullrecord | <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_02491017v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305048316301542</els_id><sourcerecordid>oai_HAL_hal_02491017v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-55da37b6bd54b9177338c3e73e0a839ac830e2053038780762ab4ade06d7247f3</originalsourceid><addsrcrecordid>eNp9kEFLw0AQhRdRsFZ_gZdcPSTOZpLs5qBQilqh4EXPy2QzabekSdktwf5701Y8enowvG_gfULcS0gkyOJxk_RbXlGSglQJyARAX4iJ1ArjPFXZpZgAQh5DpvFa3ISwAQCpASfieTawpxVHLX8726887dbORtw0zjru7CFqeh_VtKeIu4Hbfrflbh9RR-0huHArrhpqA9_95lR8vb58zhfx8uPtfT5bxhaLch_neU2oqqKq86wqpVKI2iIrZCCNJVmNwCnkCKiVBlWkVGVUMxS1SjPV4FQ8nP-uqTU777bkD6YnZxazpTneIM3KUYUa5NjFc9f6PgTPzR8gwRx1mY056TJHXQakGXWN1NOZ4nHG4NibcBLAtfNs96bu3b_8D2PiczE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Average lexicographic efficiency for data envelopment analysis</title><source>Elsevier ScienceDirect Journals</source><creator>Chen, Haoxun</creator><creatorcontrib>Chen, Haoxun</creatorcontrib><description>•A new efficiency evaluation approach is proposed for Data Envelopment Analysis.•This approach is based on lexicographical evaluations of decision-making units.•It provides a unique evaluation of the efficiency of each decision-making unit.•It is fair in some sense as the Shapley value for cooperative games.•An efficient algorithm for calculating the new efficiency measure is proposed.
Cross evaluation measures the efficiency of each DMU based on both its self-evaluation and the peer evaluations of all other DMUs. One problem of cross evaluation is that the cross efficacy scores may be not unique because of the non-uniqueness of the optimal weights of the conventional DEA model used. We propose a new approach for measuring the efficiencies of DMUs based on their lexicographical evaluations. It does not require a common set of weights for all DMUs but can provide a unique efficiency score for each DMU. In the approach, the efficiencies of the DMUs are lexicographically evaluated for each of their possible orders, subject to the constraints that the efficiencies of all DMUs already evaluated cannot be changed. The average lexicographic efficiency of each DMU is then obtained by averaging its lexicographic efficiencies. This efficiency has some desirable properties. Since all DMUs have an equal right to claim a position in the lexicographic evaluation, it is fair in some sense, as the Shapley value for payoff allocation in cooperative games. A procedure for efficiently computing the lexicographic efficiency is proposed. Numerical results on two instances demonstrate the vitality of our approach and the efficiency of its computation procedure.</description><identifier>ISSN: 0305-0483</identifier><identifier>EISSN: 1873-5274</identifier><identifier>DOI: 10.1016/j.omega.2017.01.008</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Computational complexity ; Computer Science ; Cross efficiency ; Data envelopment analysis ; Fairness ; Lexicographical evaluation ; Operations Research</subject><ispartof>Omega (Oxford), 2018-01, Vol.74, p.82-91</ispartof><rights>2017 Elsevier Ltd</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-55da37b6bd54b9177338c3e73e0a839ac830e2053038780762ab4ade06d7247f3</citedby><cites>FETCH-LOGICAL-c369t-55da37b6bd54b9177338c3e73e0a839ac830e2053038780762ab4ade06d7247f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.omega.2017.01.008$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,776,780,881,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttps://utt.hal.science/hal-02491017$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Chen, Haoxun</creatorcontrib><title>Average lexicographic efficiency for data envelopment analysis</title><title>Omega (Oxford)</title><description>•A new efficiency evaluation approach is proposed for Data Envelopment Analysis.•This approach is based on lexicographical evaluations of decision-making units.•It provides a unique evaluation of the efficiency of each decision-making unit.•It is fair in some sense as the Shapley value for cooperative games.•An efficient algorithm for calculating the new efficiency measure is proposed.
Cross evaluation measures the efficiency of each DMU based on both its self-evaluation and the peer evaluations of all other DMUs. One problem of cross evaluation is that the cross efficacy scores may be not unique because of the non-uniqueness of the optimal weights of the conventional DEA model used. We propose a new approach for measuring the efficiencies of DMUs based on their lexicographical evaluations. It does not require a common set of weights for all DMUs but can provide a unique efficiency score for each DMU. In the approach, the efficiencies of the DMUs are lexicographically evaluated for each of their possible orders, subject to the constraints that the efficiencies of all DMUs already evaluated cannot be changed. The average lexicographic efficiency of each DMU is then obtained by averaging its lexicographic efficiencies. This efficiency has some desirable properties. Since all DMUs have an equal right to claim a position in the lexicographic evaluation, it is fair in some sense, as the Shapley value for payoff allocation in cooperative games. A procedure for efficiently computing the lexicographic efficiency is proposed. Numerical results on two instances demonstrate the vitality of our approach and the efficiency of its computation procedure.</description><subject>Computational complexity</subject><subject>Computer Science</subject><subject>Cross efficiency</subject><subject>Data envelopment analysis</subject><subject>Fairness</subject><subject>Lexicographical evaluation</subject><subject>Operations Research</subject><issn>0305-0483</issn><issn>1873-5274</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><recordid>eNp9kEFLw0AQhRdRsFZ_gZdcPSTOZpLs5qBQilqh4EXPy2QzabekSdktwf5701Y8enowvG_gfULcS0gkyOJxk_RbXlGSglQJyARAX4iJ1ArjPFXZpZgAQh5DpvFa3ISwAQCpASfieTawpxVHLX8726887dbORtw0zjru7CFqeh_VtKeIu4Hbfrflbh9RR-0huHArrhpqA9_95lR8vb58zhfx8uPtfT5bxhaLch_neU2oqqKq86wqpVKI2iIrZCCNJVmNwCnkCKiVBlWkVGVUMxS1SjPV4FQ8nP-uqTU777bkD6YnZxazpTneIM3KUYUa5NjFc9f6PgTPzR8gwRx1mY056TJHXQakGXWN1NOZ4nHG4NibcBLAtfNs96bu3b_8D2PiczE</recordid><startdate>201801</startdate><enddate>201801</enddate><creator>Chen, Haoxun</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope></search><sort><creationdate>201801</creationdate><title>Average lexicographic efficiency for data envelopment analysis</title><author>Chen, Haoxun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-55da37b6bd54b9177338c3e73e0a839ac830e2053038780762ab4ade06d7247f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computational complexity</topic><topic>Computer Science</topic><topic>Cross efficiency</topic><topic>Data envelopment analysis</topic><topic>Fairness</topic><topic>Lexicographical evaluation</topic><topic>Operations Research</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Haoxun</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Omega (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Chen, Haoxun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Average lexicographic efficiency for data envelopment analysis</atitle><jtitle>Omega (Oxford)</jtitle><date>2018-01</date><risdate>2018</risdate><volume>74</volume><spage>82</spage><epage>91</epage><pages>82-91</pages><issn>0305-0483</issn><eissn>1873-5274</eissn><abstract>•A new efficiency evaluation approach is proposed for Data Envelopment Analysis.•This approach is based on lexicographical evaluations of decision-making units.•It provides a unique evaluation of the efficiency of each decision-making unit.•It is fair in some sense as the Shapley value for cooperative games.•An efficient algorithm for calculating the new efficiency measure is proposed.
Cross evaluation measures the efficiency of each DMU based on both its self-evaluation and the peer evaluations of all other DMUs. One problem of cross evaluation is that the cross efficacy scores may be not unique because of the non-uniqueness of the optimal weights of the conventional DEA model used. We propose a new approach for measuring the efficiencies of DMUs based on their lexicographical evaluations. It does not require a common set of weights for all DMUs but can provide a unique efficiency score for each DMU. In the approach, the efficiencies of the DMUs are lexicographically evaluated for each of their possible orders, subject to the constraints that the efficiencies of all DMUs already evaluated cannot be changed. The average lexicographic efficiency of each DMU is then obtained by averaging its lexicographic efficiencies. This efficiency has some desirable properties. Since all DMUs have an equal right to claim a position in the lexicographic evaluation, it is fair in some sense, as the Shapley value for payoff allocation in cooperative games. A procedure for efficiently computing the lexicographic efficiency is proposed. Numerical results on two instances demonstrate the vitality of our approach and the efficiency of its computation procedure.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.omega.2017.01.008</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0305-0483 |
ispartof | Omega (Oxford), 2018-01, Vol.74, p.82-91 |
issn | 0305-0483 1873-5274 |
language | eng |
recordid | cdi_hal_primary_oai_HAL_hal_02491017v1 |
source | Elsevier ScienceDirect Journals |
subjects | Computational complexity Computer Science Cross efficiency Data envelopment analysis Fairness Lexicographical evaluation Operations Research |
title | Average lexicographic efficiency for data envelopment analysis |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T00%3A22%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Average%20lexicographic%20efficiency%20for%20data%20envelopment%20analysis&rft.jtitle=Omega%20(Oxford)&rft.au=Chen,%20Haoxun&rft.date=2018-01&rft.volume=74&rft.spage=82&rft.epage=91&rft.pages=82-91&rft.issn=0305-0483&rft.eissn=1873-5274&rft_id=info:doi/10.1016/j.omega.2017.01.008&rft_dat=%3Chal_cross%3Eoai_HAL_hal_02491017v1%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0305048316301542&rfr_iscdi=true |