Skip to main content
SpringerLink
Log in

Algorithms for Distributed Winner Determination in Combinatorial Auctions

  • Conference paper
Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms (AMEC 2005, TADA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3937))

Abstract

The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distributed winner determination in combinatorial auctions which eliminates the centralized auctioneer. We present a set of distributed search-based algorithms for solving this problem and study their relative tradeoffs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44, 1131–1147 (1998)

    Article  MATH  Google Scholar 

  2. Sandholm, T.: An algorithm for winner determination in combinatorial auctions. Artificial Intelligence 135, 1–54 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of the Fourth International Conference on MultiAgent Systems, pp. 39–46. IEEE, Los Alamitos (2000)

    Chapter  Google Scholar 

  4. Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 1–12 (2000)

    Google Scholar 

  5. Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proceedings of the ACM Conference on Electronic Commerce (2001)

    Google Scholar 

  6. Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior 35, 166–196 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 1–13. ACM Press, New York (2002)

    Google Scholar 

  8. Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, pp. 22–29. AAAI Press/The MIT Press (2000)

    Google Scholar 

  9. Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 548–553. Morgan Kaufmann Publishers Inc., San Francisco (1999)

    Google Scholar 

  10. Preist, C., Bartolini, C., Phillips, I.: Algorithm design for agents which participate in multiple simultaneous auctions. In: Dignum, F.P.M., Cortés, U. (eds.) AMEC 2000. LNCS, vol. 2003, pp. 139–154. Springer, Heidelberg (2001)

    Google Scholar 

  11. Preist, C., Byde, A., Bartolini, C.: Economic dynamics of agents in multiple auctions. In: Proceedings of the fifth international conference on Autonomous agents, pp. 545–551. ACM Press, New York (2001)

    Chapter  Google Scholar 

  12. Wellman, M.P.: Market-oriented programming: Some early lessons. In: Clearwater, S. (ed.) Market-Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, Singapore (1996)

    Google Scholar 

  13. de Vries, S., Vohra, R.V.: Combinatorial auctions: A survey. INFORMS Journal on Computing 15, 284–309 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101, 165–200 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Willer, D. (ed.): Network Exchange Theory. Praeger Publishers, Westport CT (1999)

    Google Scholar 

  16. Kakade, S.M., Kearns, M., Ortiz, L.E., Pemantle, R., Suri, S.: Economic properties of social networks. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Advances in Neural Information Processing Systems 17, MIT Press, Cambridge (2005)

    Google Scholar 

  17. Rosenschein, J.S., Zlotkin, G.: Rules of Encounter. The MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  18. Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM conference on Electronic commerce, pp. 66–76. ACM Press, New York (2000), http://cats.stanford.edu

    Chapter  Google Scholar 

  19. Wilensky, U.: NetLogo: Center for connected learning and computer–based modeling. Northwestern University, Evanston (1999), http://ccl.northwestern.edu/netlogo/

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, University of South Carolina, Columbia, SC, 29208, USA

    Muralidhar V. Narumanchi & José M. Vidal

Authors
  1. Muralidhar V. Narumanchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José M. Vidal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CWI, Centre for Mathematics and Computer Science, Kruislaan 413, 1098 SJ, Amsterdam, Netherlands

    Han La Poutré

  2. School of Computer Science, Carnegie Mellon University, USA

    Norman M. Sadeh

  3. Swedish Institute of Computer Science, Box 1263, 164 29, Kista, Sweden

    Sverker Janson

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Narumanchi, M.V., Vidal, J.M. (2006). Algorithms for Distributed Winner Determination in Combinatorial Auctions. In: La Poutré, H., Sadeh, N.M., Janson, S. (eds) Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms. AMEC TADA 2005 2005. Lecture Notes in Computer Science(), vol 3937. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11888727_4

Download citation

  • DOI: https://doi.org/10.1007/11888727_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46242-2

  • Online ISBN: 978-3-540-46243-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation