IDEAS home Printed from https://ideas.repec.org/p/cir/cirwor/2003s-36.html
   My bibliography  Save this paper

Design for Optimized Multi-Lateral Multi-Commodity Markets

Author

Listed:
  • Benoît Bourbeau
  • Teodor Gabriel Crainic
  • Michel Gendreau
  • Jacques Robert

Abstract

In this paper, we propose a design for an an economically efficient, optimized, centralized, multi-lateral, periodic commodity market that addresses explicitly three issues: (i) substantial transportation costs between sellers and buyers; (ii) non homogeneous, in quality and nature, commodities; (iii) complementary commodities that have to be traded simultaneously. The model allows sellers to offer their commodities in lots and buyers to explicitly quantify the differences in quality of the goods produced by each individual seller. The model does not presume that products must be shipped through a market hub. We also propose a multi-round auction that enables the implementation of the direct optimized market and approximates the behaviour of the "ideal"" direct optimized mechanism. The process allows buyers and sellers to modify their initial bids, including the technological constraints. The proposed market designs are particularly relevant for industries related to natural resources. We present the models and algorithms required to implement the optimized market mechanisms, describe the operations of the multi-round auction, and discuss applications and perspectives." Nous présentons un concept de marché optimisé, centralisé, multilatéral et périodique pour l'acquisition de produits qui traite explicitement les trois aspects suivants: (i) des coûts de transport importants des vendeurs vers les acheteurs; (ii) des produits non homogènes en valeur et qualité; des complémentarités entre les divers produits qui doivent donc être négociés simultanément. Le modèle permet aux vendeurs d'offrir leurs produits groupés en lots et aux acheteurs de quantifier explicitement leur évaluation des lots mis sur le marché par chaque vendeur. Le modèle ne suppose pas que les produits doivent être expédiés par un centre avant d'être livrés. Nous proposons également un mécanisme de tâtonnement à rondes multiples qui approxime le comportement du marché direct optimisé et qui permet de mettre ce dernier en oeuvre. Le processus de tâtonnement permet aux vendeurs et aux acheteurs de modifier leurs mises initiales, incluant les contraintes technologiques. Les concepts proposés sont particulièrement adaptés aux industries reliées aux matières premières. Nous présentons les modèles et algorithmes requis à la mise en oeuvre du marché multi-latéral optimisé, nous décrivons le fonctionnement du processus de tâtonnement, et nous discutons les applications et perspectives reliées à ces mécanismes de marché.

Suggested Citation

  • Benoît Bourbeau & Teodor Gabriel Crainic & Michel Gendreau & Jacques Robert, 2003. "Design for Optimized Multi-Lateral Multi-Commodity Markets," CIRANO Working Papers 2003s-36, CIRANO.
  • Handle: RePEc:cir:cirwor:2003s-36
    as

    Download full text from publisher

    File URL: https://cirano.qc.ca/files/publications/2003s-36.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brewer, Paul J. & Plott, Charles R., 1996. "A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks," International Journal of Industrial Organization, Elsevier, vol. 14(6), pages 857-886, October.
    2. Lawrence M. Ausubel & Peter Cramton & Marek Pycia & Marzena Rostek & Marek Weretka, 2014. "Demand Reduction and Inefficiency in Multi-Unit Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1366-1400.
    3. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    4. Cramton, Peter, 1998. "Ascending auctions," European Economic Review, Elsevier, vol. 42(3-5), pages 745-756, May.
    5. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    6. Miller, Ross M., 1996. "Smart market mechanisms: From practice to theory," Journal of Economic Dynamics and Control, Elsevier, vol. 20(6-7), pages 967-978.
    7. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. John F. Raffensperger & Mark W. Milke & E. Grant Read, 2009. "A Deterministic Smart Market Model for Groundwater," Operations Research, INFORMS, vol. 57(6), pages 1333-1346, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bourbeau, Benoit & Gabriel Crainic, Teodor & Gendreau, Michel & Robert, Jacques, 2005. "Design for optimized multi-lateral multi-commodity markets," European Journal of Operational Research, Elsevier, vol. 163(2), pages 503-529, June.
    2. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    3. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    4. Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1997. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 497-527, September.
    5. Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
    6. Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
    7. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 12acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    8. Sayee Srinivasan, 2002. "Trading Portfolios Electronically – An Experimental Approach," Netnomics, Springer, vol. 4(1), pages 39-71, March.
    9. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    10. Perennes, Patricia, 2014. "Use of combinatorial auctions in the railway industry: Can the “invisible hand” draw the railway timetable?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 67(C), pages 175-187.
    11. G. Anandalingam & Robert W. Day & S. Raghavan, 2005. "The Landscape of Electronic Market Design," Management Science, INFORMS, vol. 51(3), pages 316-327, March.
    12. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
    13. Ming Fan & Jan Stallaert & Andrew B. Whinston, 2003. "Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market," Information Systems Research, INFORMS, vol. 14(1), pages 1-22, March.
    14. Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
    15. Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
    16. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    17. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
    18. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    19. Paul J. Brewer & Charles R. Plott, 2002. "A Decentralized, Smart Market Solution to a Class of Back-Haul Transportation Problems: Concept and Experimental Test Beds," Interfaces, INFORMS, vol. 32(5), pages 13-36, October.
    20. David C. Parkes & Jayant Kalagnanam, 2005. "Models for Iterative Multiattribute Procurement Auctions," Management Science, INFORMS, vol. 51(3), pages 435-451, March.

    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:cir:cirwor:2003s-36. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Webmaster (email available below). General contact details of provider: https://edirc.repec.org/data/ciranca.html .

    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.