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. 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.
    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. 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.
    4. 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.
    5. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    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. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. 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.
    3. 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.
    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. 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.
    7. Robert W. Day & Peter Cramton, 2012. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
    8. Kevin Leyton-Brown & Paul Milgrom & Neil Newman & Ilya Segal, 2023. "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.
    9. 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.
    10. 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.
    11. Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
    12. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
    13. Song, Jiongjiong & Regan, A C, 2003. "Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts," University of California Transportation Center, Working Papers qt3j7034z2, University of California Transportation Center.
    14. 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.
    15. Sayee Srinivasan, 2002. "Trading Portfolios Electronically – An Experimental Approach," Netnomics, Springer, vol. 4(1), pages 39-71, March.
    16. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    17. Cramton, Peter C, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 4(2), pages 267-343, Summer.
    18. 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.
    19. Goeree, Jacob K. & Lien, Yuanchuan, 2014. "An equilibrium analysis of the simultaneous ascending auction," Journal of Economic Theory, Elsevier, vol. 153(C), pages 506-533.
    20. Fernanda Nakano Kazama & Aluizio Fausto Ribeiro Araujo & Paulo Barros Correia & Elaine Guerrero-Peña, 2021. "Constraint-guided evolutionary algorithm for solving the winner determination problem," Journal of Heuristics, Springer, vol. 27(6), pages 1111-1150, 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: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.