Abstract
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions to be effectively applied to supply chain formation, we must ensure computational tractability and reduce bidders’ uncertainty. With this aim, we introduce Sequential Mixed Auctions (SMAs), a novel auction model conceived to help bidders collaboratively discover supply chain structures. Thus, an SMA allows bidders progressively build a supply chain structure through successive auction rounds.
Keywords
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
Cerquides, J., Endriss, U., Giovannucci, A., Rodriguez-Aguilar, J.A.: Bidding languages and winner determination for mixed multi-unit combinatorial auctions. In: IJCAI, Hyderabad, India, pp. 1221–1226 (2007)
Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press (2006)
Giovannucci, A.: Computationally Manageable Combinatorial Auctions for Supply Chain Automation. PhD thesis, Universitat Autonoma de Barcelona (2007)
Giovannucci, A., Vinyals, M., Cerquides, J., Rodriguez-Aguilar, J.A.: Computationally-efficient winner determination for mixed multi-unit combinatorial auctions. In: AAMAS, Estoril, Portugal, May 12-16, pp. 1071–1078 (2008)
Mikhaylov, B., Cerquides, J., Rodriguez-Aguilar, J.A.: Sequential mixed auctions for supply chain formation. In: International Conference on Electronic Commerce (2011)
Nisan, N.: Bidding Languages for Combinatorial Auctions. ch. 9 Combinatorial Auctions. MIT Press (2006)
Walsh, W.E., Wellman, M.P.: Decentralized supply chain formation: A market protocol and competitive equilibrium analysis. Journal of Artificial Intelligence Research 19, 513–567 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mikhaylov, B., Cerquides, J., Rodriguez-Aguilar, J.A. (2011). Solving Sequential Mixed Auctions with Integer Programming. In: Lozano, J.A., Gámez, J.A., Moreno, J.A. (eds) Advances in Artificial Intelligence. CAEPIA 2011. Lecture Notes in Computer Science(), vol 7023. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25274-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-25274-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25273-0
Online ISBN: 978-3-642-25274-7
eBook Packages: Computer ScienceComputer Science (R0)