Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Solving Sequential Mixed Auctions with Integer Programming

  • Conference paper
Advances in Artificial Intelligence (CAEPIA 2011)

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

Included in the following conference series:

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.

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. 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)

    Google Scholar 

  2. Cramton, P., Shoham, Y., Steinberg, R. (eds.): Combinatorial Auctions. MIT Press (2006)

    Google Scholar 

  3. Giovannucci, A.: Computationally Manageable Combinatorial Auctions for Supply Chain Automation. PhD thesis, Universitat Autonoma de Barcelona (2007)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. Mikhaylov, B., Cerquides, J., Rodriguez-Aguilar, J.A.: Sequential mixed auctions for supply chain formation. In: International Conference on Electronic Commerce (2011)

    Google Scholar 

  6. Nisan, N.: Bidding Languages for Combinatorial Auctions. ch. 9 Combinatorial Auctions. MIT Press (2006)

    Google Scholar 

  7. 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)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Artificial Intelligence Research Institute, IIIA Spanish National Research Council, CSIC, Spain

    Boris Mikhaylov, Jesus Cerquides & Juan A. Rodriguez-Aguilar

Authors
  1. Boris Mikhaylov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesus Cerquides
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan A. Rodriguez-Aguilar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science School, University of the Basque Country, PĂ‚Âş Manuel de Lardizabal 1, 20018, Donostia-San Sebastian, Spain

    Jose A. Lozano

  2. Computing Systems Department, University of Castilla-La Mancha, Campus Universitario s/n, 02071, Albacete, Spain

    José A. Gámez

  3. Dep. Statistics, O.R. and Computation, University of La Laguna, 38271, La Laguna, S.C. Tenerife, Spain

    José A. Moreno

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation