Bidding Languages for Continuous Auctions

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 185)

Abstract

Bidding languages are well-defined for combinatorial auctions. However, the auctions of divisible goods are quite common in practice. In contrast to combinatorial auctions, in a case of divisible commodities, the feasible volumes of offers are continuous. Thus, we call such auctions as continuous auctions. In the paper we introduce three families of bidding languages for continuous auctions. Their are based on the concepts derived from the combinatorial auctions. We generalize the language families based on goods, bids, and some mixture of both of them, to the continuous case. We also present preliminary analysis of their properties. Simple examples, reflecting the complementarity and substitutability, are provided with the exemplary representations in different languages.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benyoucef, M., Pringadi, R.: A BPEL Based Implementation of Online Auctions. In: Georgakopoulos, D., Ritter, N., Benatallah, B., Zirpins, C., Feuerlicht, G., Schoenherr, M., Motahari-Nezhad, H.R. (eds.) ICSOC 2006. LNCS, vol. 4652, pp. 104–115. Springer, Heidelberg (2007)Google Scholar
  2. 2.
    Boutilier, C., Hoos, H.H.: Bidding languages for combinatorial auctions. In: Proc. 17th Intl. Joint Conference on Artif. Intell. (2001)Google Scholar
  3. 3.
    Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence, pp. 22–29 (2000)Google Scholar
  4. 4.
    Kaleta, M., Traczyk, T. (eds.): Modeling Multi-commodity Trade. AISC, vol. 121. Springer, Heidelberg (2012)Google Scholar
  5. 5.
    Lehmann, D., Müller, R., Sandholm, T.: The winner determination problem. In: Cramton, P., Shoham, Y., Richard, S. (eds.) Combinatorial Auctions, ch. 12. MIT Press (2006)Google Scholar
  6. 6.
    Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of ACM Conference on Electronic Commerce, pp. 1–12 (2000)Google Scholar
  7. 7.
    Rolli, D., Eberhart, A.: An auction reference model for describing and running auctions. In: Proc. of the Wirtschaftsinformatik (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Warsaw University of TechnologyWarszawaPoland

Personalised recommendations