IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v117y2022icp30-46.html
   My bibliography  Save this article

Lemons and peaches: Multi-stage buying mechanisms with a Devil’s Menu

Author

Listed:
  • Gersbach, Hans
  • Mamageishvili, Akaki
  • Tejada, Oriol

Abstract

We introduce a four-stage, multi-price buying mechanism which can be used by a (big) buyer to separate low-quality sellers – called “lemon” owners – from high-quality sellers – called “peach” owners. With a partition of sellers into several groups, the buyer obtains the commodities from a desired number of “peach” owners at a price that matches their willingness to sell. For their part, “lemon” owners are trapped into selling their items at a low, or even negligible, price. We discuss several variants of this mechanism – generically called a Devil’s Menu – and show how the degree of surplus extraction by the buyer is related to the number of prices used and to the extent to which items can be bought sequentially. The common feature of all the variants is that they allow the buyer to neglect those partition groups with the highest number of false claims made by sellers who own lemons. This, in turn, yields equilibria in which no false claims are made. Our results are robust for several extensions of our baseline setup. Finally, we offer applications of our insights for market regulators, political interest groups, and decoy ballots.

Suggested Citation

  • Gersbach, Hans & Mamageishvili, Akaki & Tejada, Oriol, 2022. "Lemons and peaches: Multi-stage buying mechanisms with a Devil’s Menu," Mathematical Social Sciences, Elsevier, vol. 117(C), pages 30-46.
  • Handle: RePEc:eee:matsoc:v:117:y:2022:i:c:p:30-46
    DOI: 10.1016/j.mathsocsci.2022.01.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489622000099
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.mathsocsci.2022.01.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:matsoc:v:117:y:2022:i:c:p:30-46. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.