Solving the combinatorial double auction problem
Author
Abstract
Suggested Citation
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
- 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.
- Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
- 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.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Jinpeng Ma & Qiongling Li, 2016. "Convergence of price processes under two dynamic double auctions," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 1-44, December.
- 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.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 598, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Non-linear anonymous pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 625, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jörnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Discussion Papers 2005/6, Norwegian School of Economics, Department of Business and Management Science.
- Zhang, Meng & Kong, Zhaojun, 2023. "A two-phase combinatorial double auction and negotiation mechanism for socialized joint reserve mode in emergency preparedness," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
- 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.
- Gediminas Adomavicius & Alok Gupta, 2005. "Toward Comprehensive Real-Time Bidder Support in Iterative Combinatorial Auctions," Information Systems Research, INFORMS, vol. 16(2), pages 169-185, June.
- Holmberg, Pär & Tangerås, Thomas & Ahlqvist, Victor, 2018.
"Central- versus Self-Dispatch in Electricity Markets,"
Working Paper Series
1257, Research Institute of Industrial Economics, revised 27 Mar 2019.
- Victor Ahlqvist & Pär Holmberg & Thomas Tangerås, 2019. "Central- versus Self-Dispatch in Electricity Markets," Working Papers EPRG 1902, Energy Policy Research Group, Cambridge Judge Business School, University of Cambridge.
- Ahlqvist, V. & Holmberg, P & Tangeras, T., 2019. "Central- versus Self-Dispatch in Electricity Markets," Cambridge Working Papers in Economics 1902, Faculty of Economics, University of Cambridge.
- Choi, Jin Ho & Chang, Yong Sik & Han, Ingoo, 2009. "The empirical analysis of the N-bilateral optimized combinatorial auction model," Omega, Elsevier, vol. 37(2), pages 482-493, April.
- Ebrahim Behrouzian Nejad & Rezvan Ali poorsabzevari, 2016. "A new method of winner determination for economic resource allocation in cloud computing systems," Journal of Advances in Technology and Engineering Research, A/Professor Akbar A. Khatibi, vol. 2(1), pages 12-17.
- Csercsik, Dávid, 2022. "Convex combinatorial auction of pipeline network capacities," Energy Economics, Elsevier, vol. 111(C).
- Armenia, Stefano & Franco, Eduardo & Iandolo, Francesca & Maielli, Giuliano & Vito, Pietro, 2024. "Zooming in and out the landscape: Artificial intelligence and system dynamics in business and management," Technological Forecasting and Social Change, Elsevier, vol. 200(C).
- Meeus, Leonardo & Verhaegen, Karolien & Belmans, Ronnie, 2009. "Block order restrictions in combinatorial electric energy auctions," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1202-1206, August.
- Petr Fiala, 2016. "Supply chain coordination with auctions," Journal of Business Economics, Springer, vol. 86(1), pages 155-171, January.
- Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
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.- 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.
- Avenali, Alessandro, 2009. "Exploring the VCG mechanism in combinatorial auctions: The threshold revenue and the threshold-price rule," European Journal of Operational Research, Elsevier, vol. 199(1), pages 262-275, November.
- 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.
- 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.
- 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.
- 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.
- Dries R. Goossens & Rudolf Müller & Frits C. R. Spieksma, 2010. "Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 339-352, August.
- Ming Fan & Jan Stallaert & Andrew B. Whinston, 2003. "Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market," Information Systems Research, INFORMS, vol. 14(1), pages 1-22, March.
- Gediminas Adomavicius & Alok Gupta & Mochen Yang, 2022. "Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework," Information Systems Research, INFORMS, vol. 33(4), pages 1174-1195, December.
- Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
- 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.
- 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.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 598, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2007. "Non-linear anonymous pricing combinatorial auctions," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 625, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
- Drexl, Andreas & Jörnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Discussion Papers 2005/6, Norwegian School of Economics, Department of Business and Management Science.
- 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.
- Joni L. Jones & Gary J. Koehler, 2005. "A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 475-489, November.
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:eee:ejores:v:164:y:2005:i:1:p:239-251. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.