The generalized DEA model and the convex cone constrained game (Q5928443)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The generalized DEA model and the convex cone constrained game |
scientific article; zbMATH DE number 1582675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The generalized DEA model and the convex cone constrained game |
scientific article; zbMATH DE number 1582675 |
Statements
The generalized DEA model and the convex cone constrained game (English)
0 references
14 January 2002
0 references
The authors propose a two-person zero-sum game with convex cone restrictions on the mixed strategies in order to solve a certain Data Envelopment Analysis (DEA) problem. The properties of the game and its relation to DEA are investigated and proved. The related literature is reviewed.
0 references
data envelopment analysis
0 references
game theory
0 references
0 references
0 references
0 references
0 references
0.8355188369750977
0 references
0.8173882961273193
0 references
0.8082224130630493
0 references
0.7892276644706726
0 references
0.7645612955093384
0 references
