Existence of Equilibrium for Integer Allocation Problems

Somdeb Lahiri (lahiriifmr.ac.in)

Abstract: In this paper we show that if all agents are equipped with discrete concave production functions, then a feasible price allocation pair is a market equilibrium if and only if it solves a linear programming problem, similar to, but perhaps simpler than the one invoked in Yang (2001). Using this result, but assuming discrete concave production functions for the agents once again, we are able to show that the necessary and sufficient condition for the existence of market equilibrium available in Sun and Yang (2004), which involved obtaining a price vector that satisfied infinitely many inequalities, can be reduced to one where such a price vector satisfies finitely many inequalities. A necessary and sufficient condition for the existence of a market equilibrium when the maximum value function is Weakly Monotonic at the initial endowment that follows from our results is that the maximum value function is partially concave at the initial endowment.

Keywords: discrete concave, existence, market equilibrium, integer allocation, linear programming

Category 1: Other Topics (Game Theory )

Category 2: Linear, Cone and Semidefinite Programming (Linear Programming )

Citation: ifmr/cafs/lahiri/3

Download: [PDF]

Entry Submitted: 12/27/2005
Entry Accepted: 01/02/2006
Entry Last Modified: 05/23/2006

Modify/Update this entry