On a Game Theoretic Notion of Complexity for Compact Convex Sets

DOI10.2307/2040657zbMATH Open0313.90015OpenAlexW4238576150MaRDI QIDQ4073089FDOQ4073089

Authors: Ehud Kalai, Meir Smorodinsky 

Publication date: 1975

Full work available at URL: https://doi.org/10.2307/2040657

Mathematics Subject Classification ID

Cooperative games (91A12) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Trade models (91B60)

Cites Work

• A Characterization of Pareto Surfaces

Cited In (3)

• Dense families of low-complexity attainable sets of markets
• Attainable Sets of Quasiconcave Markets
• On game-type subsets

This page was built for publication: On a Game Theoretic Notion of Complexity for Compact Convex Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4073089)