IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v36y2025i3p1718-1737.html
   My bibliography  Save this article

Walrasian Pricing for Combinatorial Markets with Compact-Bidding Languages: An Application to Truckload Transportation

Author

Listed:
  • Mohsen Emadikhiav

    (Department of Information Technology and Operations Management, College of Business, Florida Atlantic University, Boca Raton, Florida 33431)

  • Robert Day

    (Department of Operations and Information Management, School of Business, University of Connecticut, Storrs, Connecticut 06269)

Abstract

Combinatorial auctions offer several economic advantages but also face multiple technical challenges, including bid generation, the need to solve a combinatorial allocation problem, and determining reasonable prices. These challenges are even more pronounced in a combinatorial exchange, where bidders can simultaneously buy and sell combinations of goods. Motivated by truckload transportation markets, we explore new mechanisms for finding linear and anonymous Walrasian equilibrium prices in combinatorial auctions and exchanges where bidders can use a compact-bidding language to express their potentially complex preferences. With the goal of improving economic efficiency and reducing the environmental impact of the trucking industry, we identify significant potential gains by developing a method for integrated allocation and price determination based on an industry-specific bidding language. We also demonstrate our proposed mechanism’s adaptability and flexibility by considering a number of practical constraints.

Suggested Citation

  • Mohsen Emadikhiav & Robert Day, 2025. "Walrasian Pricing for Combinatorial Markets with Compact-Bidding Languages: An Application to Truckload Transportation," Information Systems Research, INFORMS, vol. 36(3), pages 1718-1737, September.
    • Handle: RePEc:inm:orisre:v:36:y:2025:i:3:p:1718-1737
    DOI: 10.1287/isre.2023.0676
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/isre.2023.0676
    Download Restriction: no
    File URL: https://libkey.io/10.1287/isre.2023.0676?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:inm:orisre:v:36:y:2025:i:3:p:1718-1737. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.