“The Competitive Allocation Process Is Informationally Efficient Uniquely”, J. S. Jordan1982-10 (algorithms, mechanism design)⁠:

[see earlier Mount & Reiter1974] This paper establishes that the competitive allocation process is the only informationally decentralized mechanism for exchange environments which:

1. achieves Pareto optimal allocations;

2. gives each consumer an allocation which is, according to his preferences, at least as good as his endowment;

3. satisfies certain regularity conditions; and

4. has a message space of the smallest dimension necessary to satisfy (1–3).