On a game theoretic notion of complexity for compact convex sets
HTML articles powered by AMS MathViewer
- by Ehud Kalai and Meir Smorodinsky
- Proc. Amer. Math. Soc. 49 (1975), 416-420
- DOI: https://doi.org/10.1090/S0002-9939-1975-0368707-8
- PDF | Request permission
Abstract:
The notion of complexity for compact convex sets introduced by Billera and Bixby is considered. It is shown that for $n \geq 3$ there are sets in ${R^n}$ of complexity $n$. Also for $n = 3$ the maximal complexity is 3.References
- Louis J. Billera and Robert E. Bixby, A characterization of Pareto surfaces, Proc. Amer. Math. Soc. 41 (1973), 261–267. MR 325163, DOI 10.1090/S0002-9939-1973-0325163-1
Bibliographic Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 49 (1975), 416-420
- MSC: Primary 90A15; Secondary 52-XX
- DOI: https://doi.org/10.1090/S0002-9939-1975-0368707-8
- MathSciNet review: 0368707