In this paper we show that a feasible price allocation pair is a market equilibrium of a discrete market game if and only if it solves a linear programming problem. We use this result to obtain computable necessary and sufficient conditions for the existence of market equilibrium. We assume that the production functions of the profit maximizing agents are discrete concave.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Find related papers by JEL classification: C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory D8 - Microeconomics - - Information, Knowledge, and Uncertainty
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: