IDEAS home Printed from https://ideas.repec.org/p/nid/ndagan/011.html

Consistent Solutions in Exchange Economies: a Characterization of the Price Mechanism

Author

Abstract

We characterize the Walrasian allocations correspondence by means of four axioms: consistency, replica invariance, individual rationality and Pareto optimality. It is shown that for any given class of exchange economies any solution that satisfies the axioms is a selection from the Walrasian allocations with slack. Preferences are assumed to be smooth, but may be satiated and non-convex. A class of economies is defined as all economies whose agents' preferences belong to an arbitrary family (finite or infinite) of types. The result can be modified to characterize equal budget Walrasian allocations with slack by replacing individual rationality with individual rationality from equal division. The results are valid also for classes of economies in which core--Walras equivalence does not hold.

Suggested Citation

  • Nir Dagan, 1995. "Consistent Solutions in Exchange Economies: a Characterization of the Price Mechanism," Economic theory and game theory 011, Nir Dagan.
    • Handle: RePEc:nid:ndagan:011
    as

    Download full text from publisher

    File URL: https://www.nirdagan.com/research/199501/full.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sönmez, Tayfun & Ünver, M. Utku, 2010. "House allocation with existing tenants: A characterization," Games and Economic Behavior, Elsevier, vol. 69(2), pages 425-445, July.
    2. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    3. Nir Dagan, 1996. "Consistency and the Walrasian Allocations Correspondence," Economic theory and game theory 012, Nir Dagan.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nid:ndagan:011. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Nir Dagan (email available below). General contact details of provider: https://www.nirdagan.com/research/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.