Management Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MANAGEMENT SCIENCE
Vol. 51, No. 1, January 2005, pp. 76-91
DOI: 10.1287/mnsc.1040.0230
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Gallien, J.
Right arrow Articles by Wein, L. M.
Right arrow Search for Related Content

A Smart Market for Industrial Procurement with Capacity Constraints

Jérémie Gallien, Lawrence M. Wein

Sloan School of Management, Massachusetts Institute of Technology, 50 Memorial Drive, Cambridge, Massachusetts 02142
Graduate School of Business, Stanford University, 518 Memorial Way, Stanford, California 94306

jgallien{at}mit.edu
lwein{at}stanford.edu

We address the problem of designing multi-item procurement auctions for a monopsonistic buyer in capacity-constrained environments. Using insights from classical auction theory, we construct an optimization-based auction mechanism ("smart market") relying on the dynamic resolution of a linear program minimizing the buyer's cost under the suppliers' capacity constraints. Suppliers can modify their offers in response to the optimal allocation corresponding to each set of bids, giving rise to a dynamic competitive bidding process. To assist suppliers, we also develop a bidding-suggestion device based on a myopic best-response (MBR) calculation that solves an associated optimization problem. Assuming linear costs for the suppliers, we study within a game-theoretic framework the sequence of bids arising in this smart market. Under a weak behavioral assumption and some symmetry requirements, an explicit upper bound for the winning bids is established. We then formulate a complete behavioral model and solution methodology based on the MBR rationale and show that the bounds derived earlier continue to hold. We analytically derive some structural and convergence properties of the MBR dynamics in the simplest nontrivial market environment, which suggests further possible design improvements, and investigate bidding dynamics and incentive compatibility issues via numerical simulations.

Key Words: procurement auctions; smart markets; iterative bidding mechanism; best response
History: Received: October 24, 2000;


This article has been cited by other articles:


Home page
Management ScienceHome page
L. Y. Chu
Truthful Bundle/Multiunit Double Auctions
Management Science, July 1, 2009; 55(7): 1184 - 1198.
[Abstract] [PDF]


Home page
Operations ResearchHome page
L. Y. Chu and Z.-J. M. Shen
Truthful Double Auction Mechanisms
Operations Research, January 1, 2008; 56(1): 102 - 120.
[Abstract] [PDF]


Home page
Management ScienceHome page
Z. Guo, G. J. Koehler, and A. B. Whinston
A Market-Based Optimization Algorithm for Distributed Systems
Management Science, August 1, 2007; 53(8): 1345 - 1358.
[Abstract] [PDF]


Home page
Management ScienceHome page
G. P. Cachon and F. Zhang
Obtaining Fast Service in a Queueing System via Performance-Based Allocation of Demand
Management Science, March 1, 2007; 53(3): 408 - 420.
[Abstract] [PDF]


Home page
Management ScienceHome page
R. R. Chen, R. O. Roundy, R. Q. Zhang, and G. Janakiraman
Efficient Auction Mechanisms for Supply Chain Procurement
Management Science, March 1, 2005; 51(3): 467 - 482.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.