Abstract
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determination problem for such auctions using integer programming. Mixed multi-unit combinatorial auctions are auctions where bidders can offer combinations of transformations of goods rather than just simple goods. This model has great potential for applications in the context of supply chain formation, which is further enhanced by the integration of time constraints. We consider different kinds of time constraints: they may be based on either time points or intervals, they may determine a relative ordering of transformations, they may relate transformations to absolute time points, and they may constrain the duration of transformations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cerquides, J., Endriss, U., Giovannucci, A., Rodríguez-Aguilar, J.A.: Bidding languages and winner determination for mixed multi-unit combinatorial auctions. In: Veloso, M. (ed.) Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), Hyderabad, India, pp. 1221–1226 (2007)
Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Inc., New York (1986)
Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinational auctions. Management Science 44(8), 1131–1147 (1998)
Fionda, V., Greco, G.: Charting the tractability frontier of mixed Multi-Unit combinatorial auctions. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, CA (July 2009)
Giovannucci, A., Vinyals, M., Rodríguez-Aguilar, J.A., Cerquides, J.: Computationally efficient winner determination for mixed multi-unit combinatorial auctions. In: Proc. 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), IFAAMAS (2008)
Ottens, B., Endriss, U.: Comparing winner determination algorithms for mixed multi-unit combinatorial auctions. In: Proc. 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), IFAAMAS (2008)
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Hunsberger, L., Grosz, B.J.: A combinatorial auction for collaborative planning. In: Proc. 4th International Conference on MultiAgent Systems. IEEE Computer Society (2000)
Collins, J.E.: Solving combinatorial auctions with temporal constraints in economic agents. PhD thesis, University of Minnesota (2002)
Wellman, M.P., Walsh, W.E., Wurman, P.R., MacKie-Mason, J.K.: Auction protocols for decentralized scheduling. Games and Economic Behavior 35(1-2), 271–303 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witzel, A., Endriss, U. (2012). Time Constraints in Mixed Multi-unit Combinatorial Auctions. In: David, E., Larson, K., Rogers, A., Shehory, O., Stein, S. (eds) Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. AMEC TADA 2010 2010. Lecture Notes in Business Information Processing, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34200-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-34200-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34199-1
Online ISBN: 978-3-642-34200-4
eBook Packages: Computer ScienceComputer Science (R0)