Classification of Two-Person Ordinal Bimatrix Games
The set of possible outcomes of a strongly ordinal bimatrix game is studied by imbedding each pair of possible payoffs as a point on the standard two-dimensional integral lattice. In particular, we count the number of different Pareto optimal sets of each cardinality; we establish asymptotic bounds for the number of different convex hulls of the point sets, for the average shape of the set of points dominated by the Pareto optimal set, and for the average shape of the convex hull of the point set. We also indicate the effect of individual rationality considerations on our results. As most of our results are asymptotic, the appendix includes a careful examination of the important case of 2 x 2 games.
|Date of creation:||Oct 1991|
|Date of revision:|
|Publication status:||Published in International Journal of Game Theory (1992), 21(3): 267-290|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:996. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Matthew C. Regan)
If references are entirely missing, you can add them using this form.