Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19848
Title: The generalized DEA model and the convex cone constrained game
Authors: Hao, G
Wei, QL
Yan, H 
Keywords: Game theory
Convex cone
Data envelopment analysis
Issue Date: 2000
Publisher: Elsevier
Source: European journal of operational research, 2000, v. 126, no. 3, p. 515-525 How to cite?
Journal: European journal of operational research 
Abstract: This study extends the research on relating the data envelopment analysis (DEA) with the game theory context. We propose a generalized model for the two-person zero-sum finite game with closed convex cone constraints. We prove that the strategy of the closed convex cone constrained two-person zero-sum finite game is equivalent to the solution of the corresponding cone constrained programming problem. We show the existence of an optimal strategy of closed convex cone constrained two-person zero-sum finite game. As a special case of this, we give the optimal strategy of a polyhedral constrained game. In this case, the corresponding dual programming problems are a pair of linear dual programming problems. We then build up the connection between the proposed convex cone constrained game model and the generalized DEA model. With this relationship, a more robust correspondence between game family and the DEA family is established.
URI: http://hdl.handle.net/10397/19848
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/S0377-2217(99)00306-9
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

5
Last Week
0
Last month
Citations as of Oct 18, 2017

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Oct 13, 2017

Page view(s)

51
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.