On the informational efficiency of the competitive resource allocation process

The purpose of this paper is to formalize the competitive process as a parametric process, and then prove the minimality of its message space among the message spaces for a broad class of parametric processes that includes the class of processes considered by Hurwicz (in “Studies in Resource Allocation Processes” (K. J. Arrow and L. Hurwicz, Eds.), pp. 413–423, Cambridge Univ. Press, Cambridge, 1977), Mount and Reiter (J. Econ. Theory6 (1974), 161–192), and Osana (J. Econ. Theory17 (1978), 66–78). The proof of this result turns crucially on the “asymmetry property” (which is stronger than the well-known “uniqueness property” of Hurwicz) and on an injectiveness lemma which is applicable to parametric processes.