Back to Fundamentals: Convex Geometry and Economic Equilibrium
Abstract
We propose a notion of competitive equilibrium in an abstract setting called a Convex Economy using a concept of convexity borrowed from Convex Geometry. The "magic" of linear equilibrium prices is put into perspective in this abstract setting. The abstract notion of competitive equilibrium is applied to a variety of convex economies and versions of the first and second fundamental welfare theorems are proved.
References (16)
- Aizerman, Mark A. and Andrei V. Malishevski. 1981. "Some Aspects of the General Theory of Best Option Choice". Avtomatika i Telemekhanika (Automation and Remote Control), 42, 65-83.
- Baldwin, Elizabeth and Paul Klemperer. 2013. "Tropical Geometry to Analyse Demand". Nuffield College, mimeo.
- Danilov, Vladimir, Gleb A Koshevoy and Kazuo Murota. 2001. "Discrete Convexity and Equilibria in Economies with Indivisible Goods and Money". Mathematical Social Sciences, 44, 251-273.
- Edelman, Paul. H. and Robert E. Jamison. 1985. "The Theory of Convex Geometries". Geometriae Dedicata, 19, 247-270.
- Koshevoy, Gleb A. 1999. "Choice Functions and Abstract Convex Geometries". Mathematical Social Sciences, 38, 35-44.
- Piccione, Michele and Ariel Rubinstein. 2007. "Equilibrium in the Jungle". Economic Journal, 117, 883-896.
- Sen, Amartya K. 1970. Collective Choice and Social Welfare. Holden-Day.
- Shapley, Lloyd S. and Herbert E. Scarf. 1974. "On Cores and Indivisibility". Journal of Mathematical Economics, 1, 23-37. Footnotes
- By A2, KA ∩ B ⊆ KA ∩ KB and thus KA ∩ B ⊆ A ∩ B. By A1, A ∩ B ⊆ KA ∩ B.
- By A3, A1A2, A2 accordingly KA KKA ⊇ KA x ⊇ KA.
- If z ∈ extA -extA -x, then KA -z ⊂ KA and KA -x KA -x -z. By A2, KA -x -z ⊆ KA -z. Thus, KA -x ⊂ KA, contradicting x ∉ extA. If z ∈ extA -x -extA, then KA -x -z ⊂ KA -x and KA -z KA. By x ∉ extA, we have KA -x KA and thus, KA -x -z ⊂ KA. To obtain a contradiction to A4, note that: (i) By A3, KA -x -z is convex.
- x ∉ KA -x -z because otherwise by F2, KA -x -z KA -z KA. Similarly, z ∉ KA -x -z.
- KKA -x -z x ⊇ KA -x -z x KA -z KA (the inclusion is by A1 and A2) and thus z ∈ KKA -x -z x. Similarly, x ∈ KKA -x -z z.
- Let x ∈ A -extA. Then, KA -x KA. It is then sufficient to notice that by F3 extA -x extA and to iteratively remove elements of A -extA from A. 5. See Theorem 4 in Koshevoy (1999).
- Let a ∈ extA ∩ A ′ . If a ∉ extA ′ , then a ∈ KA ′ -a and by A2 a ∈ KA -a and by F2 KA -a KA, contradicting a ∈ extA.
- Take x ∈ A -extA. By F4, extA -x extA. Iteratively apply to all members of A -A ′ .