IDEAS home Printed from https://ideas.repec.org/a/jas/jasssj/2009-41-2.html
   My bibliography  Save this article

An Agent Based Market Design Methodology for Combinatorial Auctions

Author

Listed:

Abstract

Auction mechanisms have attracted a great deal of interest and have been used in diverse e-marketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions. Therefore, diverse combinatorial auction market types have been proposed to satisfy market needs. These combinatorial auction types have diverse market characteristics, which require an effective market design approach. This study proposes a comprehensive and systematic market design methodology for combinatorial auctions based on three phases: market architecture design, auction rule design, and winner determination design. A market architecture design is for designing market architecture types by Backward Chain Reasoning. Auction rules design is to design transaction rules for auctions. The specific auction process type is identified by the Backward Chain Reasoning process. Winner determination design is about determining the decision model for selecting optimal bids and auctioneers. Optimization models are identified by Forward Chain Reasoning. Also, we propose an agent based combinatorial auction market design system using Backward and Forward Chain Reasoning. Then we illustrate a design process for the general n-bilateral combinatorial auction market. This study serves as a guideline for practical implementation of combinatorial auction markets design.

Suggested Citation

  • Jinho Choi & Gyoo Gun Lim & Kun Chang Lee, 2010. "An Agent Based Market Design Methodology for Combinatorial Auctions," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 13(2), pages 1-2.
    • Handle: RePEc:jas:jasssj:2009-41-2
    as

    Download full text from publisher

    File URL: https://www.jasss.org/13/2/2/2.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Holzman, Ron & Kfir-Dahav, Noa & Monderer, Dov & Tennenholtz, Moshe, 2004. "Bundling equilibrium in combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 47(1), pages 104-123, 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. Sulin Ba & Jan Stallaert & Andrew B. Whinston, 2001. "Research Commentary: Introducing a Third Dimension in Information Systems Design—The Case for Incentive Alignment," Information Systems Research, INFORMS, vol. 12(3), pages 225-239, September.
    2. Xia, Mu & Koehler, Gary J. & Whinston, Andrew B., 2004. "Pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 154(1), pages 251-270, April.
    3. 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.
    4. Mingrong Wang & Mingxi Wang & Lihua Lang, 2017. "Reconsidering Carbon Permits Auction Mechanism: An Efficient Dynamic Model," The World Economy, Wiley Blackwell, vol. 40(8), pages 1624-1645, August.
    5. Andor Goetzendorff & Martin Bichler & Pasha Shabalin & Robert W. Day, 2015. "Compact Bid Languages and Core Pricing in Large Multi-item Auctions," Management Science, INFORMS, vol. 61(7), pages 1684-1703, July.
    6. Philippe Jehiel & Benny Moldovanu, 2005. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Levine's Bibliography 784828000000000490, UCLA Department of Economics.
    7. Suchul Lee & Jong-yi Hong, 2019. "Analyzing the change in knowledge sharing efficiency of knowledge networks: a case study," Information Technology and Management, Springer, vol. 20(1), pages 41-53, March.
    8. Müller, R.J. & Perea ý Monsuwé, A. & Wolf, S., 2007. "Combinatorial scoring auctions," Research Memorandum 020, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. Fadaei, Salman & Bichler, Martin, 2017. "Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets," European Journal of Operational Research, Elsevier, vol. 260(2), pages 767-777.
    10. 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).
    11. Schellhorn, Henry, 2009. "A double-sided multiunit combinatorial auction for substitutes: Theory and algorithms," European Journal of Operational Research, Elsevier, vol. 197(2), pages 799-808, September.
    12. Sulin Ba & Barrie R. Nault, 2017. "Emergent Themes in the Interface Between Economics of Information Systems and Management of Technology," Production and Operations Management, Production and Operations Management Society, vol. 26(4), pages 652-666, April.
    13. Xia, Mu & Stallaert, Jan & Whinston, Andrew B., 2005. "Solving the combinatorial double auction problem," European Journal of Operational Research, Elsevier, vol. 164(1), pages 239-251, July.
    14. Rajiv D. Banker & Robert J. Kauffman, 2004. "50th Anniversary Article: The Evolution of Research on Information Systems: A Fiftieth-Year Survey of the Literature in Management Science," Management Science, INFORMS, vol. 50(3), pages 281-298, March.
    15. 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.
    16. Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
    17. Michael D. Smith & Rahul Telang, 2004. "Incentives and Protocols for Self-Organizing Interest-Based Peer-to-Peer Networks," Working Papers 04-12, NET Institute, revised Oct 2004.
    18. Samaddar, Subhashish & Kadiyala, Savitha S., 2006. "An analysis of interorganizational resource sharing decisions in collaborative knowledge creation," European Journal of Operational Research, Elsevier, vol. 170(1), pages 192-210, April.
    19. Henry Schellhorn, 2004. "A Double-Sided Multiunit Combinatorial Auction for Substitutes: Theory and Algorithms," FAME Research Paper Series rp123, International Center for Financial Asset Management and Engineering.
    20. Mu'alem, Ahuva & Nisan, Noam, 2008. "Truthful approximation mechanisms for restricted combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 64(2), pages 612-631, 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:jas:jasssj:2009-41-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: Francesco Renzini (email available below). General contact details of provider: .

    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.