IDEAS home Printed from https://ideas.repec.org/a/kap/compec/v47y2016i3d10.1007_s10614-015-9496-5.html
   My bibliography  Save this article

Winner Determination Algorithms for Combinatorial Auctions with Sub-cardinality Constraints

Author

Listed:
  • Christopher Garcia

    (University of Mary Washington)

Abstract

We examine the winner determination problem for combinatorial auctions with sub-cardinality constraints (WDP-SC). In this type of auction, bidders submit bids for packages of items of interest together with a specific number of items they want. All items in a package are equally acceptable, but each bidder wants only the specified number of items in their package and not necessarily all. This type of auction is particularly relevant in cases where bidders are interested in items in close proximity to one another and view items as largely substitutable. We show that WDP-SC is NP-hard. We then develop an integer programming (IP) formulation and two approximation algorithms for solving WDP-SC: one based on simulated annealing (SA) and one based on the Metaheuristic for Randomized Priority Search (Meta-RaPS). We assess the performance of these three methods through computational tests performed on sets of large benchmark problems (ranging from 1000 to 10,000 bids) generated from four different distributions: two developed specifically to simulate proximity concerns, and two others previously used in the literature. IP produced the best solutions for 1000-bid problems, but in many cases SA and Meta-RaPS produced better solutions than IP on larger problems. Both IP and Meta-RaPS appear to be robust solution methods for this problem and consistently produced high-quality solutions across all problem sizes and distributions.

Suggested Citation

  • Christopher Garcia, 2016. "Winner Determination Algorithms for Combinatorial Auctions with Sub-cardinality Constraints," Computational Economics, Springer;Society for Computational Economics, vol. 47(3), pages 401-421, March.
    • Handle: RePEc:kap:compec:v:47:y:2016:i:3:d:10.1007_s10614-015-9496-5
    DOI: 10.1007/s10614-015-9496-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10614-015-9496-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10614-015-9496-5?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. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    2. 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.
    3. DePuy, Gail W. & Moraga, Reinaldo J. & Whitehouse, Gary E., 2005. "Meta-RaPS: a simple and effective approach for solving the traveling salesman problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(2), pages 115-130, March.
    4. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    5. Cason, Timothy N. & Plott, Charles R., 1996. "EPA's New Emissions Trading Mechanism: A Laboratory Evaluation," Journal of Environmental Economics and Management, Elsevier, vol. 30(2), pages 133-160, March.
    6. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    7. Wu, Lihua & Wang, Yuyun, 1998. "An Introduction to Simulated Annealing Algorithms for the Computation of Economic Equilibrium," Computational Economics, Springer;Society for Computational Economics, vol. 12(2), pages 151-169, October.
    8. Quan, Daniel C, 1994. "Real Estate Auctions: A Survey of Theory and Practice," The Journal of Real Estate Finance and Economics, Springer, vol. 9(1), pages 23-49, July.
    9. A. Mochon & Y. Saez & J. Gómez-Barroso & P. Isasi, 2011. "The Clock Proxy Auction for Allocating Radio Spectrum Licenses," Computational Economics, Springer;Society for Computational Economics, vol. 37(4), pages 411-431, April.
    Full references (including those not matched with items on IDEAS)

    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 & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 10acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
    2. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    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. Vangerven, Bart & Goossens, Dries R. & Spieksma, Frits C.R., 2017. "Winner determination in geometrical combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 258(1), pages 254-263.
    5. Tobias Scheffel & Georg Ziegler & Martin Bichler, 2012. "On the impact of package selection in combinatorial auctions: an experimental study in the context of spectrum auction design," Experimental Economics, Springer;Economic Science Association, vol. 15(4), pages 667-692, December.
    6. 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.
    7. 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.
    8. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    9. Hans‐Theo Normann & Roberto Ricciuti, 2009. "Laboratory Experiments For Economic Policy Making," Journal of Economic Surveys, Wiley Blackwell, vol. 23(3), pages 407-432, July.
    10. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    11. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    12. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.
    13. Kevin Leyton-Brown & Paul Milgrom & Neil Newman & Ilya Segal, 2024. "Artificial Intelligence and Market Design: Lessons Learned from Radio Spectrum Reallocation," NBER Chapters, in: New Directions in Market Design, National Bureau of Economic Research, Inc.
    14. 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.
    15. Bart Vangerven & Dries R. Goossens & Frits C. R. Spieksma, 2021. "Using Feedback to Mitigate Coordination and Threshold Problems in Iterative Combinatorial Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 63(2), pages 113-127, April.
    16. Lindsay, Luke, 2018. "Shapley value based pricing for auctions and exchanges," Games and Economic Behavior, Elsevier, vol. 108(C), pages 170-181.
    17. Bourbeau, Benoit & Gabriel Crainic, Teodor & Gendreau, Michel & Robert, Jacques, 2005. "Design for optimized multi-lateral multi-commodity markets," European Journal of Operational Research, Elsevier, vol. 163(2), pages 503-529, June.
    18. Munro, David R. & Rassenti, Stephen J., 2019. "Combinatorial clock auctions: Price direction and performance," Games and Economic Behavior, Elsevier, vol. 117(C), pages 195-217.
    19. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    20. Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.

    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:compec:v:47:y:2016:i:3:d:10.1007_s10614-015-9496-5. 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.