On a game theoretic notion of complexity for compact convex sets

Ehud Kalai; Meir Smorodinsk

doi:10.1090/S0002-9939-1975-0368707-8

On a game theoretic notion of complexity for compact convex sets

Ehud Kalai, Meir Smorodinsk

Managerial Economics, Decision Sciences and Operations

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

The notion of complexity for compact convex sets introduced by Billera and Bixby is considered. It is shown that for n ≥ 3 there are sets in Rⁿ of complexity n. Also for n=3 the maximal complexity is 3.

Original language	English (US)
Pages (from-to)	416-420
Number of pages	5
Journal	Proceedings of the American Mathematical Society
Volume	49
Issue number	2
DOIs	https://doi.org/10.1090/S0002-9939-1975-0368707-8
State	Published - Jun 1975

Keywords

Compact convex sets
Complexity
Concave utility functions
Market games

ASJC Scopus subject areas

General Mathematics
Applied Mathematics

Access to Document

10.1090/S0002-9939-1975-0368707-8

Cite this

@article{efb4a04d853c40bf8e47ac769decbf02,

title = "On a game theoretic notion of complexity for compact convex sets",

abstract = "The notion of complexity for compact convex sets introduced by Billera and Bixby is considered. It is shown that for n ≥ 3 there are sets in Rn of complexity n. Also for n=3 the maximal complexity is 3.",

keywords = "Compact convex sets, Complexity, Concave utility functions, Market games",

author = "Ehud Kalai and Meir Smorodinsk",

year = "1975",

month = jun,

doi = "10.1090/S0002-9939-1975-0368707-8",

language = "English (US)",

volume = "49",

pages = "416--420",

journal = "Proceedings of the American Mathematical Society",

issn = "0002-9939",

publisher = "American Mathematical Society",

number = "2",

}

TY - JOUR

T1 - On a game theoretic notion of complexity for compact convex sets

AU - Kalai, Ehud

AU - Smorodinsk, Meir

PY - 1975/6

Y1 - 1975/6

N2 - The notion of complexity for compact convex sets introduced by Billera and Bixby is considered. It is shown that for n ≥ 3 there are sets in Rn of complexity n. Also for n=3 the maximal complexity is 3.

AB - The notion of complexity for compact convex sets introduced by Billera and Bixby is considered. It is shown that for n ≥ 3 there are sets in Rn of complexity n. Also for n=3 the maximal complexity is 3.

KW - Compact convex sets

KW - Complexity

KW - Concave utility functions

KW - Market games

UR - http://www.scopus.com/inward/record.url?scp=84968503866&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84968503866&partnerID=8YFLogxK

U2 - 10.1090/S0002-9939-1975-0368707-8

DO - 10.1090/S0002-9939-1975-0368707-8

M3 - Article

AN - SCOPUS:84968503866

SN - 0002-9939

VL - 49

SP - 416

EP - 420

JO - Proceedings of the American Mathematical Society

JF - Proceedings of the American Mathematical Society

IS - 2

ER -

On a game theoretic notion of complexity for compact convex sets

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this