IDEAS home Printed from https://ideas.repec.org/a/kap/netnom/v3y2001i1d10.1023_a1009940607600.html
   My bibliography  Save this article

Optimization in electronic markets: examples in combinatorial auctions

Author

Listed:
  • Stan van Hoesel

    (University of Maastricht)

  • Rudolf Müller

    (University of Maastricht)

Abstract

Combinatorial auctions provide an important tool for mechanism design in multi-agent systems. When implemented they require to solve combinatorial optimization problems such as set packing and partitioning problems. We present in this paper an analysis of the complexity of the problem to assign bids to bidders in combinatorial auctions. We show that the case of identical assets can be solved in polynomial time. The case of non-identical assets is in its general version NP-hard. Extra structure, like a complete ordering of assets, or mild side conditions make the problem solvable. Finally, we present an algorithm to solve small and medium sized instances in a limited time using standard software.

Suggested Citation

  • Stan van Hoesel & Rudolf Müller, 2001. "Optimization in electronic markets: examples in combinatorial auctions," Netnomics, Springer, vol. 3(1), pages 23-33, June.
    • Handle: RePEc:kap:netnom:v:3:y:2001:i:1:d:10.1023_a:1009940607600
    DOI: 10.1023/A:1009940607600
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009940607600
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1009940607600?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ken Binmore & Nir Vulkan, 1999. "Applying game theory to automated negotiation," Netnomics, Springer, vol. 1(1), pages 1-9, October.
    2. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    3. Ken Binmore & Nir Vulkan, "undated". "Applying Game Theory to Automated Negotiation," ELSE working papers 004, ESRC Centre on Economics Learning and Social Evolution.
    4. John McMillan, 1994. "Selling Spectrum Rights," Journal of Economic Perspectives, American Economic Association, vol. 8(3), pages 145-162, Summer.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dries R. Goossens & Sander Onderstal & Jan Pijnacker & Frits C. R. Spieksma, 2014. "Solids: A Combinatorial Auction for Real Estate," Interfaces, INFORMS, vol. 44(4), pages 351-363, August.
    2. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    3. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009. "Non-linear anonymous pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
    4. Jing Yu & Lining Xing & Xu Tan, 0. "The new treatment mode research of hepatitis B based on ant colony algorithm," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    5. Jing Yu & Lining Xing & Xu Tan, 2021. "The new treatment mode research of hepatitis B based on ant colony algorithm," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 740-759, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1997. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 497-527, September.
    2. Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
    3. Oktay Günlük & Lászlo Ladányi & Sven de Vries, 2005. "A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions," Management Science, INFORMS, vol. 51(3), pages 391-406, March.
    4. Sulin Ba & Jan Stallaert & Andrew B. Whinston, 2001. "Optimal Investment in Knowledge Within a Firm Using a Market Mechanism," Management Science, INFORMS, vol. 47(9), pages 1203-1219, September.
    5. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 12acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    6. van Bragt, David & van Kemenade, Cees & la Poutre, Han, 2001. "The Influence of Evolutionary Selection Schemes on the Iterated Prisoner's Dilemma," Computational Economics, Springer;Society for Computational Economics, vol. 17(2-3), pages 253-263, June.
    7. A Drexl & K Jørnsten, 2007. "Reflections about pseudo-dual prices in combinatorial auctions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1652-1659, December.
    8. Sunnevag, Kjell J., 2000. "Designing auctions for offshore petroleum lease allocation," Resources Policy, Elsevier, vol. 26(1), pages 3-16, March.
    9. Ervasti, Valtteri & Leskelä, Riikka-Leena, 2010. "Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support," European Journal of Operational Research, Elsevier, vol. 203(1), pages 251-260, May.
    10. Park, Sunju & Rothkopf, Michael H., 2005. "Auctions with bidder-determined allowable combinations," European Journal of Operational Research, Elsevier, vol. 161(2), pages 399-415, March.
    11. Ivan Marsa-Maestre & Miguel A. Lopez-Carmona & Juan A. Carral & Guillermo Ibanez, 2013. "A Recursive Protocol for Negotiating Contracts Under Non-monotonic Preference Structures," Group Decision and Negotiation, Springer, vol. 22(1), pages 1-43, January.
    12. D.D.B. Bragt, van & J. A. La Poutr & E. H. Gerding, 2000. "Equilibrium Selection In Evolutionary Bargaining Models," Computing in Economics and Finance 2000 323, Society for Computational Economics.
    13. Enrico Gerding & David van Bragt & Han La Poutré, 2003. "Multi-Issue Negotiation Processes by Evolutionary Simulation, Validation and Social Extensions," Computational Economics, Springer;Society for Computational Economics, vol. 22(1), pages 39-63, August.
    14. Michael H. Rothkopf, 2007. "Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical," Operations Research, INFORMS, vol. 55(2), pages 191-197, April.
    15. R. Preston McAfee & John McMillan, 1996. "Analyzing the Airwaves Auction," Journal of Economic Perspectives, American Economic Association, vol. 10(1), pages 159-175, Winter.
    16. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    17. Peter Cramton, 1997. "The FCC Spectrum Auctions: An Early Assessment," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 431-495, September.
    18. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    19. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Column aggregation-based pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 624, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Michael H. Rothkopf & Sunju Park, 2001. "An Elementary Introduction to Auctions," Interfaces, INFORMS, vol. 31(6), pages 83-97, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netnom:v:3:y:2001:i:1:d:10.1023_a:1009940607600. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.