The generalized DEA model and the convex cone constrained game (Q5928443)

From MaRDI portal
Revision as of 15:53, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1582675
Language Label Description Also known as
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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    data envelopment analysis
    0 references
    game theory
    0 references