Advertisement

Solids - A Combinatorial Auction for a Housing Corporation

  • Dries R. Goossens
  • Sander Onderstal
  • Frits C. R. Spieksma
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 80)

Abstract

On May 7, 2011, over one hundred bidders took part in a combinatorial auction for housing space in a newly erected building in Amsterdam (the Netherlands). This paper describes the development of this auction. We sketch our collaboration with the housing corporation that resulted in design choices with respect to first/second price, feedback, number of rounds, and tractability of the combinatorial auction. Furthermore, the winner determination problem is complicated by various municipal and building regulations that the allocation needs to satisfy. We show how these regulations can be included in an integer program that is used to solve the winner determination problem. Finally, computational experiments illustrate the tractability of this model.

Keywords

combinatorial auction housing auction design integer program 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Solids: an introduction, http://www.solids.nl/english
  2. 2.
    Bijdendijk, F.: Met andere ogen. Het Oosten Woningcorporatie, Amsterdam (2006)Google Scholar
  3. 3.
    Cramton, P., Steinberg, R., Shoham, Y.: Combinatorial auctions. MIT Press (2005)Google Scholar
  4. 4.
    Day, R.W., Raghavan, S.: Matrix bidding in combinatorial auctions. Operations Research 57(4), 916–933 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Goossens, D.R., Müller, R., Spieksma, F.C.R.: Algorithms for recognizing economic properties in matrix bid combinatorial auctions. INFORMS Journal on Computing 22(3), 339–352 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Goossens, D.R., Spieksma, F.C.R.: Exact algorithms for the matrix bid auction. Computers and Operations Research 36, 1090–1109 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Goossens, D.R., Spieksma, F.C.R.: Design Study Solids-veiling (2010) (Confidential, in Dutch)Google Scholar
  8. 8.
    Nisan, N.: Bidding and allocation in combinatorial auctions. In: EC 2000: Proceedings of the 2nd ACM Conference on Electronic Commerce, Minneapolis, USA, pp. 1–12. ACM Press (2000)Google Scholar
  9. 9.
    Rothkopf, M.H., Pekeç, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44(8), 1131–1147 (1998)CrossRefzbMATHGoogle Scholar
  10. 10.
    Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135(1-2), 1–54 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Tennenholtz, M.: Tractable combinatorial auctions and b-matching. Artificial Intelligence 140(1-2), 231–243 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Van Hoesel, S., Müller, R.: Optimization in electronic markets: examples in combinatorial auctions. Netnomics 3(1), 23–33 (2001)CrossRefGoogle Scholar
  13. 13.
    Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance 16, 8–37 (1961)MathSciNetCrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2012

Authors and Affiliations

  • Dries R. Goossens
    • 1
  • Sander Onderstal
    • 2
  • Frits C. R. Spieksma
    • 3
  1. 1.PostDoc researcher for Research Foundation - Flanders, Center for Operations Research and Business Statistics (ORSTAT), Faculty of Business and EconomicsKU LeuvenBelgium
  2. 2.University of AmsterdamThe Netherlands
  3. 3.Center for Operations Research and Business Statistics (ORSTAT), Faculty of Business and EconomicsKU LeuvenBelgium

Personalised recommendations