Design of a Combinatorial Bidding Market for Green Corridor Freight
The Green Corridor (GC) initiative, pursued by the Swedish government and the European Commission, is intended to be a platform for innovation for long-distance freight transport aiming for more green and efficient solutions by enhanced use of economies of scale and development of new technologies. However, scale has to be traded off by two other aspects (i) freight transport time and reliability; and (ii) economies of scope. In this paper we present an already existing rail corridor case that highlights the need for tools (and/or markets) for making more efficient tradeoffs between economies of scale and scope in long-distance freight transport. This involves making very complex coordination of shipments that are differentiated with respect to origins-destinations, shipment size, time, time reliability requirements, regularity of shipments and involving both ex ante transport planning and real-time control. A market-based method that in principle could be used to solve such complex coordination is combinatorial auctioning and we briefly review a number of Swedish public tendering cases where this is done in practice. However, this raises questions on whether a fragmented vertically separated European rail industry can mobilize the “soft” market infrastructure needed to support a Green Corridor.
|Date of creation:||16 Apr 2013|
|Date of revision:|
|Contact details of provider:|| Postal: Örebro University School of Business, SE - 701 82 ÖREBRO, Sweden|
Phone: 019-30 30 00
Fax: 019-33 25 46
Web page: http://www.oru.se/Institutioner/Handelshogskolan-vid-Orebro-universitet/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Yokoo, Makoto & Sakurai, Yuko & Matsubara, Shigeo, 2004. "The effect of false-name bids in combinatorial auctions: new fraud in internet auctions," Games and Economic Behavior, Elsevier, vol. 46(1), pages 174-188, January.
- Kagel, John H. & Levin, Dan, 2005. "Multi-unit demand auctions with synergies: behavior in sealed-bid versus ascending-bid uniform-price auctions," Games and Economic Behavior, Elsevier, vol. 53(2), pages 170-207, November.
- Chew Soo Hong & Shigehiro Serizawa, 2005.
"Characterizing the Vickrey Combinatorial Auction by Induction,"
ISER Discussion Paper
0631, Institute of Social and Economic Research, Osaka University.
- Soo Chew & Shigehiro Serizawa, 2007. "Characterizing the Vickrey combinatorial auction by induction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 393-406, November.
- Lunander, Anders & Lundberg, Sofia, 2011.
"Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts,"
Umeå Economic Studies
825, Umeå University, Department of Economics.
- Lunander, Anders & Lundberg, Sofia, 2009. "Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts," Umeå Economic Studies 776, Umeå University, Department of Economics, revised 16 Sep 2009.
- Holzman, Ron & Monderer, Dov, 2004. "Characterization of ex post equilibrium in the VCG combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 47(1), pages 87-103, April.
- Vijay Krishna & Robert Rosenthal, 1995.
"Simultaneous Auctions with Synergies,"
0056, Boston University - Industry Studies Programme.
- Anders Lunander & Jan-Eric Nilsson, 2004. "Taking the Lab to the Field: Experimental Tests of Alternative Mechanisms to Procure Multiple Contracts," Journal of Regulatory Economics, Springer, vol. 25(1), pages 39-58, January.
When requesting a correction, please mention this item's handle: RePEc:hhs:oruesi:2013_006. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.