Market-Based Allocation with Indivisible Bids

  • L. Julian Schvartzman
  • Michael P. Wellman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3937)


We study multi-unit double auctions accepting bids with indivisibility constraints. We propose different price-quote policies and study their influence on the efficiency of market-based allocation. Using a reconfigurable manufacturing scenario where agents trade large quantities of multiple goods, we demonstrate potential benefits of supporting indivisibility constraints in bidding. These benefits are highly sensitive to the form of price quote provided, indicating interesting tradeoffs in communication and allocation efficiency.


Unit Price Order Book Combinatorial Auction Auction Mechanism Integer Linear Programming Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press, Cambridge (2005)Google Scholar
  2. 2.
    Cheng, J.Q., Wellman, M.P.: The WALRAS algorithm: A convergent distributed implementation of general equilibrium outcomes. Computational Economics 12, 1–24 (1998)CrossRefMATHGoogle Scholar
  3. 3.
    Ygge, F., Akkermans, H.: Decentralized markets versus central control: A comparative study. Journal of Artificial Intelligence Research 11, 301–333 (1999)MATHGoogle Scholar
  4. 4.
    Nisan, N.: Bidding and allocation in combinatorial auctions. In: Second ACM Conference on Electronic Commerce, Minneapolis, pp. 1–12 (2000)Google Scholar
  5. 5.
    Kelly, T.: Generalized knapsack solvers for multi-unit combinatorial auctions: Analysis and application to computational resource allocation. In: AAMAS 2004 Workshop on Agent-Mediated Electronic Commerce (AMEC-VI), New York (2004)Google Scholar
  6. 6.
    Wurman, P.R., Walsh, W.E., Wellman, M.P.: Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems 24, 17–27 (1998)CrossRefGoogle Scholar
  7. 7.
    van Hoesel, S., Müller, R.: Optimization in electronic markets: Examples in combinatorial auctions. Netnomics 3, 23–33 (2001)CrossRefGoogle Scholar
  8. 8.
    Kothari, A., Parkes, D.C., Suri, S.: Approximately-strategyproof and tractable multi-unit auctions. In: Fourth ACM Conference on Electronic Commerce, San Diego, CA, pp. 166–175 (2003)Google Scholar
  9. 9.
    Kalagnanam, J.R., Davenport, A.J., Lee, H.S.: Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research 1, 221–238 (2001)CrossRefMATHGoogle Scholar
  10. 10.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004)CrossRefMATHGoogle Scholar
  11. 11.
    Dudzinski, K., Walukiewicz, S.: Exact method for the knapsack problem and its generalizations. European Journal of Operations Research 28, 3–21 (1987)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Wurman, P.R., Wellman, M.P., Walsh, W.E.: A parametrization of the auction design space. Games and Economic Behavior 35, 304–338 (2001)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Lochner, K.M., Wellman, M.P.: Rule-based specification of auction mechanisms. In: Third International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2004), New York, pp. 818–825 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • L. Julian Schvartzman
    • 1
  • Michael P. Wellman
    • 1
  1. 1.Computer Science & EngineeringUniversity of MichiganAnn ArborUSA

Personalised recommendations