User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse





Pareto-Optimal Matching Allocation Mechanisms for Boundedly Rational Agents


Bade,  Sophie
Max Planck Institute for Research on Collective Goods, Max Planck Society;

External Ressource
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Bade, S. (2010). Pareto-Optimal Matching Allocation Mechanisms for Boundedly Rational Agents.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0028-6C8F-C
This article is concerned with the welfare properties of trade when the behavior of agents cannot be rationalized by preferences. I investigate this question in an environment of matching allocation problems. There are two reasons for doing so: rstly, the niteness of such problems entails that the domain of the agents' choice behavior does not need to be restricted in any which way to obtain results on the welfare properties of trade. Secondly, some matching allocation mechanisms have been designed for non-market environments in which we would typically expect boundedly rational behavior. I nd quali ed support for the statements that all outcomes of trade are Pareto-optimal and all Pareto optima are reachable through trade. Contrary to the standard case, di erent trading mechanisms lead to di erent outcome sets when the agents' behavior is not rationalizable. These results remain valid when restricting attention to \minimally irrational" behavior.