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.
Keywords
- Combinatorial Auction
- Feasible Allocation
- Stochastic Local Search
- Winner Determination
- Winner Determination Problem
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44, 1131–1147 (1998)
Sandholm, T.: An algorithm for winner determination in combinatorial auctions. Artificial Intelligence 135, 1–54 (2002)
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)
Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 1–12 (2000)
Zurel, E., Nisan, N.: An efficient approximate allocation algorithm for combinatorial auctions. In: Proceedings of the ACM Conference on Electronic Commerce (2001)
Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior 35, 166–196 (2001)
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)
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)
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)
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)
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)
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)
de Vries, S., Vohra, R.V.: Combinatorial auctions: A survey. INFORMS Journal on Computing 15, 284–309 (2003)
Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101, 165–200 (1998)
Willer, D. (ed.): Network Exchange Theory. Praeger Publishers, Westport CT (1999)
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)
Rosenschein, J.S., Zlotkin, G.: Rules of Encounter. The MIT Press, Cambridge (1994)
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
Wilensky, U.: NetLogo: Center for connected learning and computer–based modeling. Northwestern University, Evanston (1999), http://ccl.northwestern.edu/netlogo/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)