IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v32y2002i5p4-12.html

The First Use of a Combined-Value Auction for Transportation Services

Author

Listed:
  • John O. Ledyard

    (Division of the Humanities and Social Sciences, California Institute of Technology, Mailcode 228-77, Pasadena, California 91125)

  • Mark Olson

    (Interdisciplinary Center for Economic Science, George Mason University, MSN 1B2, 4400 University Drive, Fairfax, Virginia 22030-4444)

  • David Porter

    (Interdisciplinary Center for Economic Science, George Mason University, MSN 1B2, 4400 University Drive, Fairfax, Virginia 22030-4444)

  • Joseph A. Swanson

    (Joseph Swanson and Company, 312 South Main Street, Racine, Wisconsin 53403–1029)

  • David P. Torma

    (Joseph Swanson and Company, 312 South Main Street, Racine, Wisconsin 53403–1029)

Abstract

Combined-value auctions (CVAs) allow participants to make an offer of a single amount for a collection of items. These auctions provide value to both buyers and sellers of goods or services in a number of environments, but they have rarely been implemented, perhaps because of lack of knowledge and experience. Sears Logistics Services (SLS) is the first procurer of trucking services to use a CVA to reduce its costs. In 1993, it saved 13 percent over past procurement practices. Experimental economics played a crucial role in the development, sale, and use of the CVA.

Suggested Citation

  • John O. Ledyard & Mark Olson & David Porter & Joseph A. Swanson & David P. Torma, 2002. "The First Use of a Combined-Value Auction for Transportation Services," Interfaces, INFORMS, vol. 32(5), pages 4-12, October.
    • Handle: RePEc:inm:orinte:v:32:y:2002:i:5:p:4-12
    DOI: 10.1287/inte.32.5.4.30
    as

    Download full text from publisher

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

    Other versions of this item:

    References listed on IDEAS

    as
    1. Jeffrey S. Banks & John O. Ledyard & David P. Porter, 1989. "Allocating Uncertain and Unresponsive Resources: An Experimental Approach," RAND Journal of Economics, The RAND Corporation, vol. 20(1), pages 1-25, Spring.
    2. Arthur M. Geoffrion & Ramayya Krishnan, 2001. "Prospects for Operations Research in the E-Business Era," Interfaces, INFORMS, vol. 31(2), pages 6-36, April.
    3. Coppinger, Vicki M & Smith, Vernon L & Titus, Jon A, 1980. "Incentives and Behavior in English, Dutch and Sealed-Bid Auctions," Economic Inquiry, Western Economic Association International, vol. 18(1), pages 1-22, January.
    4. 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.
    5. Bossaerts, Peter & Fine, Leslie & Ledyard, John, 2002. "Inducing liquidity in thin financial markets through combined-value trading mechanisms," European Economic Review, Elsevier, vol. 46(9), pages 1671-1695, October.
    Full references (including those not matched with items on IDEAS)

    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. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    2. Ledyard, John & Hanson, Robin & Ishikida, Takashi, 2009. "An experimental test of combinatorial information markets," Journal of Economic Behavior & Organization, Elsevier, vol. 69(2), pages 182-189, February.
    3. Banks, Jeffrey & Olson, Mark & Porter, David & Rassenti, Stephen & Smith, Vernon, 2003. "Theory, experiment and the federal communications commission spectrum auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 51(3), pages 303-350, July.
    4. Nicolas Gruyer & Nathalie Lenoir, 2003. "Auctioning airport slots (?)," Post-Print hal-01021718, HAL.
    5. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    6. 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.
    7. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.
    8. John McMillan, 1994. "Selling Spectrum Rights," Journal of Economic Perspectives, American Economic Association, vol. 8(3), pages 145-162, Summer.
    9. Bart Vangerven & Dries R. Goossens & Frits C. R. Spieksma, 2021. "Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 63(2), pages 113-127, April.
    10. 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.
    11. Jorrat, Diego, 2021. "Recruiting experimental subjects using WhatsApp," Journal of Behavioral and Experimental Economics (formerly The Journal of Socio-Economics), Elsevier, vol. 90(C).
    12. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    13. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    14. Ching-Hua Chen-Ritzo & Terry P. Harrison & Anthony M. Kwasnica & Douglas J. Thomas, 2005. "Better, Faster, Cheaper: An Experimental Analysis of a Multiattribute Reverse Auction Mechanism with Restricted Information Feedback," Management Science, INFORMS, vol. 51(12), pages 1753-1762, December.
    15. Joni L. Jones & Gary J. Koehler, 2005. "A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 475-489, November.
    16. Charles R. Plott, 1997. "Laboratory Experimental Testbeds: Application to the PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 605-638, September.
    17. Sayee Srinivasan, 2002. "Trading Portfolios Electronically – An Experimental Approach," Netnomics, Springer, vol. 4(1), pages 39-71, March.
    18. 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.
    19. Laurent Lamy, 2007. "Contingent Auctions with Allocative Externalities : Vickrey Versus the Ausubel-Milgrom Proxy Auction," Working Papers 2007-26, Center for Research in Economics and Statistics.
    20. David V. Budescu & Boris Maciejovsky, 2005. "The Effect of Payoff Feedback and Information Pooling on Reasoning Errors: Evidence from Experimental Markets," Management Science, INFORMS, vol. 51(12), pages 1829-1843, December.

    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:orinte:v:32:y:2002:i:5:p:4-12. 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: 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.