Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective
暂无分享,去创建一个
[1] S. Rassenti,et al. A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .
[2] J. Banks,et al. Allocating uncertain and unresponsive resources: an experimental approach. , 1989, The Rand journal of economics.
[3] Christopher George Caplice,et al. An optimization based bidding process : a new framework for shipper-carrier relationships , 1996 .
[4] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[5] J. Ledyard,et al. A NEW AND IMPROVED DESIGN FOR MULTI-OBJECT ITERATIVE AUCTIONS , 1999 .
[6] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[7] Moshe Tennenholtz,et al. An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.
[8] F. Kelly,et al. A Combinatorial Auction with Multiple Winners for Universal Service , 2000 .
[9] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.
[10] Mark M. Bykowsky,et al. Mutually Destructive Bidding: The FCC Auction Design Problem , 2000 .
[11] Amelia C. Regan,et al. Transition or Transformation?: Emerging Freight Transportation Intermediaries , 2001 .
[12] Joseph A. Swanson,et al. Special Issue: Experimental Economics in Practice: The First Use of a Combined-Value Auction for Transportation Services , 2002, Interfaces.
[13] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[14] Anthony M. Kwasnica,et al. A New and Improved Design for Multiobject Iterative Auctions , 2005, Manag. Sci..