An Abortion Based Search Method for Optimal Coalition Structure Generation
Author
Abstract
Suggested Citation
DOI: 10.1007/s10726-022-09781-2
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
- Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
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.- 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.
- 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.
- Peter Cramton, 2002. "Spectrum Auctions," Papers of Peter Cramton 01hte, University of Maryland, Department of Economics - Peter Cramton, revised 16 Jul 2001.
- 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.
- Pinar Keskinocak & Shidhar Tayur, 2001. "Quantitative Analysis for Internet-Enabled Supply Chains," Interfaces, INFORMS, vol. 31(2), pages 70-89, April.
- 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.
- repec:dau:papers:123456789/5665 is not listed on IDEAS
- 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.
- Richard Li-Yang Chen & Shervin AhmadBeygi & Amy Cohn & Damian R. Beil & Amitabh Sinha, 2009. "Solving Truckload Procurement Auctions Over an Exponential Number of Bundles," Transportation Science, INFORMS, vol. 43(4), pages 493-510, November.
- Song, Jiongjiong & Regan, Amelia, 2005. "Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts," Transportation Research Part B: Methodological, Elsevier, vol. 39(10), pages 914-933, December.
- 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.
- 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.
- Tuomas Sandholm & Anton Likhodedov, 2015. "Automated Design of Revenue-Maximizing Combinatorial Auctions," Operations Research, INFORMS, vol. 63(5), pages 1000-1025, October.
- Nilsson, Jan-Eric, 2012. "Congestion and scarcity in scheduled transport modes," Working papers in Transport Economics 2012:25, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
- 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.
- Albert Banal-Estañol & Augusto Rupérez-Micola, 2010.
"Are agent-based simulations robust? The wholesale electricity trading case,"
Economics Working Papers
1214, Department of Economics and Business, Universitat Pompeu Fabra.
- Albert Banal-Estañol & Augusto Rupérez Micola, 2010. "Are Agent-based Simulations Robust? The Wholesale Electricity Trading Case," Working Papers 443, Barcelona School of Economics.
- Babaioff, Moshe & Blumrosen, Liad, 2008. "Computationally-feasible truthful auctions for convex bundles," Games and Economic Behavior, Elsevier, vol. 63(2), pages 588-620, July.
- 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.
More about this item
Keywords
Coalition structure generation; Dynamic programming; Coalition formation;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:spr:grdene:v:31:y:2022:i:4:d:10.1007_s10726-022-09781-2. 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.