Games with Unique Solutions Which Are Nonconvex

W. F. Lucas

ResearchPublished 1967

Describes an eight-person Von Neumann-Morgenstern game with a solution of a type not previously reported: a polyhedron within four dimensions, unique and nonconvex. Previously known unique solutions have always been convex polyhedrons. The essential idea is the existence of a line L with a large Dom L. This property can be generalized in many dimensions in such a way as to describe many other games that maintain the corresponding L as a subset of the core. Large classes of interesting solutions will be obtained, many of them unique and nonconvex. These results suggest the possibility that not all [n]-person games have solutions, probably the most important unresolved issue in game theory.

Document Details

Citation

Chicago Manual of Style

Lucas, W. F., Games with Unique Solutions Which Are Nonconvex. Santa Monica, CA: RAND Corporation, 1967. https://www.rand.org/pubs/research_memoranda/RM5363.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.