Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts

[1]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[2]  S. Rassenti,et al.  A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .

[3]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[4]  J. Banks,et al.  Allocating uncertain and unresponsive resources: an experimental approach. , 1989, The Rand journal of economics.

[5]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[6]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[7]  Christopher George Caplice,et al.  An optimization based bidding process : a new framework for shipper-carrier relationships , 1996 .

[8]  David Simchi-Levi,et al.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows , 1997, Oper. Res..

[9]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[10]  David C. Parkes,et al.  Accounting for Cognitive Costs in On-Line Auction Design , 1998, AMET.

[11]  David C. Parkes,et al.  Optimal Auction Design for Agents with Hard Valuation Problems , 1999, Agent Mediated Electronic Commerce.

[12]  J. Ledyard,et al.  A NEW AND IMPROVED DESIGN FOR MULTI-OBJECT ITERATIVE AUCTIONS , 1999 .

[13]  Carles Sierra,et al.  Agent Mediated Electronic Commerce II, Towards Next-Generation Agent-Based Electronic Commerce Systems, IJCAI 1999 Workshop , 2000 .

[14]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[15]  Moshe Tennenholtz,et al.  An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.

[16]  David C. Parkes,et al.  Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment , 2000, AAAI/IAAI.

[17]  Daniel Lehmann,et al.  Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.

[18]  David C. Parkes,et al.  Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.

[19]  Mark M. Bykowsky,et al.  Mutually Destructive Bidding: The FCC Auction Design Problem , 2000 .

[20]  Tuomas Sandholm,et al.  Computationally Limited Agents in Auctions , 2001 .

[21]  T. Sandholm,et al.  Preference Elicitation in Combinatorial Auctions (Extended Abstract) , 2001 .

[22]  Joseph A. Swanson,et al.  Special Issue: Experimental Economics in Practice: The First Use of a Combined-Value Auction for Transportation Services , 2002, Interfaces.

[23]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[24]  Gary J. Koehler,et al.  Combinatorial auctions using rule-based bids , 2002, Decis. Support Syst..

[25]  Amelia C. Regan,et al.  An Auction Based Collaborative Carrier Network , 2003 .

[26]  Y. Sheffi,et al.  OPTIMIZATION‐BASED PROCUREMENT FOR TRANSPORTATION SERVICES , 2003 .

[27]  A. Regan,et al.  Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective , 2003 .

[28]  I. Vogelsang,et al.  Handbook of telecommunications economics, volume I. structure, regulation & competition. Cave, M., Majumdar , 2010 .

[29]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[30]  Michel Gendreau,et al.  A new bidding framework for combinatorial e-auctions , 2004, Comput. Oper. Res..

[31]  Yossi Sheffi,et al.  Combinatorial Auctions in the Procurement of Transportation Services , 2004, Interfaces.

[32]  Anthony M. Kwasnica,et al.  A New and Improved Design for Multiobject Iterative Auctions , 2005, Manag. Sci..

[33]  F. Ygge.  Optimal Auction Design for Agents with Hard Valuation Problems , .