Winner Determination Algorithms for Combinatorial Auctions with Sub-cardinality Constraints
Author
Abstract
Suggested Citation
DOI: 10.1007/s10614-015-9496-5
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- 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.
- Cason, Timothy N. & Plott, Charles R., "undated". "EPA's New Emissions Trading Mechanism: A Laboratory Evaluation," Working Papers 863, California Institute of Technology, Division of the Humanities and Social Sciences.
- 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.
- 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.
- Lawrence M. Ausubel & Peter Cramton & R. Preston McAfee & John McMillan, 1998. "Synergies in Wireless Telephony: Evidence from the Broadband PCS Auctions," Papers of Peter Cramton 97jems, University of Maryland, Department of Economics - Peter Cramton, revised 09 Jun 1998.
- 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.
- 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.
- 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.
- Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
- 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.
- 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.
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.- 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.
- 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.
- Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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.
- 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.
- 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.
- 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.
- MISHRA, Debasis & PARKES, David C., 2005. "Ascending price Vickrey auctions for general valuations," LIDAM Discussion Papers CORE 2005052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- DeMartini, Christine & Kwasnica, Anthony M. & Ledyard, John O. & Porter, David, 1998. "A New and Improved Design For Multi-Object Iterative Auctions," Working Papers 1054, California Institute of Technology, Division of the Humanities and Social Sciences.
- 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.
- Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
- 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.
- 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.
- Peter Cramton, 1995. "Money Out of Thin Air: The Nationwide Narrowband PCS Auction," Papers of Peter Cramton 95jems, University of Maryland, Department of Economics - Peter Cramton, revised 09 Jun 1998.
- 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.
- William E. Walsh & Michael P. Wellman, 1999. "Efficiency and Equilibrium in Task Allocation Economics with Hierarchical Dependencies," Working Papers 99-07-049, Santa Fe Institute.
- 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.
- David R. Munro & Stephen Rassenti, 2011. "Combinatorial Clock Auctions: Price Direction and Performance," Working Papers 11-19, Chapman University, Economic Science Institute.
- Ronald M. Harstad & Aleksandar Saša Pekeč, 2008. "Relevance to Practice and Auction Theory: A Memorial Essay for Michael Rothkopf," Interfaces, INFORMS, vol. 38(5), pages 367-380, October.
- Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
- Ausubel Lawrence M & Milgrom Paul R, 2002.
"Ascending Auctions with Package Bidding,"
The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
- Lawrence M. Ausubel & Paul Milgrom, 2002. "Ascending Auctions with Package Bidding," Working Papers 02004, Stanford University, Department of Economics.
- Peter Cramton, 1997.
"The FCC Spectrum Auctions: An Early Assessment,"
Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 431-495, September.
- Peter Cramton, 1997. "The FCC Spectrum Auctions: An Early Assessment," Papers of Peter Cramton 97jemsfcc, University of Maryland, Department of Economics - Peter Cramton, revised 12 Jul 1998.
- R. H. Kwon & G. Anandalingam & L. H. Ungar, 2005. "Iterative Combinatorial Auctions with Bidder-Determined Combinations," Management Science, INFORMS, vol. 51(3), pages 407-418, March.
- Regan, A C & Song, Jiongjiong, 2003. "Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective," University of California Transportation Center, Working Papers qt7sq003mj, University of California Transportation Center.
More about this item
Keywords
Combinatorial auction; Proximity bidding; Integer programming; Simulated annealing; Meta-RaPS; Combinatorial optimization;All these keywords.
Statistics
Access and download statisticsCorrections
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.