Feasible and Continuous Double Implementation of Constrained Walrasian Allocations
Guoqiang Tian
Abstract
Open-access reader
Guoqiang Tian
Abstract
Open-access reader
This paper provides a simple, feasible, and continuous mechanism whose Nash allocations and strong Nash allocations coincide with constrained Walrasian allocations for pure exchange economies. This mechanism allows not only references and initial endowments but also coalition patterns to be privately observed, a feature missing from much recent work in implementation theory. Unlike most mechanisms proposed in the literature, our mechanism works not only for three or more agents, but also for two-agent economies, and thus it is a unified mechanism which is irrespective of the number of agents. In addition, our implementation result is obtained without modifying individuals' preferences and thus it improves the mechanism proposed in Peleg (1996) without having to define artificial preference relations on price messages announced by individuals.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper provides a simple, feasible, and continuous mechanism whose Nash allocations and strong Nash allocations coincide with constrained Walrasian allocations for pure exchange economies. This mechanism allows not only references and initial endowments but also coalition patterns to be privately observed, a feature missing from much recent work in implementation theory. Unlike most mechanisms proposed in the literature, our mechanism works not only for three or more agents, but also for two-agent economies, and thus it is a unified mechanism which is irrespective of the number of agents. In addition, our implementation result is obtained without modifying individuals' preferences and thus it improves the mechanism proposed in Peleg (1996) without having to define artificial preference relations on price messages announced by individuals.
Key concepts: Mechanism (biology), Nash equilibrium, Mathematical economics, Economics, Preference, Mechanism design, Walrasian auction, Simple (philosophy)