Advertisement

Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions

  • S. Kameshwaran
  • Lyés Benyoucef
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)

Abstract

Discount auction is a market mechanism for buying heterogeneous items in a single auction. The suppliers submit discount bids, which consist of two parts: the individual cost for each of the items and discounts based on the number of items procured. The winner determination problem faced by the buyer is to determine the winning suppliers and their corresponding winning items, such that the total cost of procurement is minimized. This problem is \({\cal NP}\)-hard and in this paper we propose a novel branch and bound algorithm called as branch on price, which uses a tight integer programming formulation with valid inequalities. Computational experiments show that the proposed algorithm is many folds faster than the existing algorithm.

Keywords

Priority Queue Valid Inequality Linear Programming Relaxation Combinatorial Auction Demand Node 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rothkopf, M.H., Park, S.: An elementary introduction to auctions. Interfaces 31(6), 83–97 (2001)Google Scholar
  2. 2.
    Kameshwaran, S., Benyoucef, L., Xie, X.: Discount auctions for procuring heterogeneous items. In: Kishino, F., Kitamura, Y., Kato, H., Nagata, N. (eds.) ICEC 2005. LNCS, vol. 3711, pp. 244–249. Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Kameshwaran, S., Benyoucef, L., Xie, X.: Winner determination in discount auctions. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 868–877. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Eso, M., Ghosh, S., Kalagnanam, J., Ladanyi, L.: Bid evaluation in procurement auctions with piece-wise linear supply curves. Research Report RC 22219, IBM Research, Yorktown Heights, NJ, USA (2001)Google Scholar
  5. 5.
    Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2006)MATHGoogle Scholar
  6. 6.
    Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Management Science 51, 374–390 (2005)CrossRefGoogle Scholar
  7. 7.
    Wolsey, L.A.: Integer Programming. John Wiley and Sons, New York (1998)MATHGoogle Scholar
  8. 8.
    Chandru, V., Rao, M.R.: Integer programming. In: Atallah, M.J. (ed.) Handbook of Algorithms and Theory of Computing, pp. 32.1–32.45. CRC Press, Boca Raton (1999)Google Scholar
  9. 9.
    Murty, K.G.: Linear and Combinatorial Programming. R.E. Krieger (1985)Google Scholar
  10. 10.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)MATHGoogle Scholar
  11. 11.
    ILOG CPLEX: ILOG Concert Technology 1.1 User’s Manual (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • S. Kameshwaran
    • 1
  • Lyés Benyoucef
    • 1
  1. 1.INRIA LorraineMetzFrance

Personalised recommendations