IDEAS home Printed from https://ideas.repec.org/a/inm/orisre/v23y2012i3-part-1p823-843.html
   My bibliography  Save this article

A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation

Author

Listed:
  • Zhiling Guo

    (Department of Information Systems, College of Business, City University of Hong Kong, Kowloon, Hong Kong)

  • Gary J. Koehler

    (Department of Information Systems and Operations Management, Warrington College of Business Administration, University of Florida, Gainesville, Florida 32611)

  • Andrew B. Whinston

    (Department of Information, Risk, and Operations Management, McCombs School of Business, The University of Texas at Austin, Austin, Texas 78712)

Abstract

Online auction markets play increasingly important roles for resource allocations in distributed systems. This paper builds upon a market-based framework presented by Guo et al. (Guo, Z., G. J. Koehler, A. B. Whinston. 2007. A market-based optimization algorithm for distributed systems. Management Sci . 53 (8) 1345--1458), where a distributed system optimization problem is solved by self-interested agents iteratively trading bundled resources in a double auction market run by a dealer. We extend this approach to a dynamic, asynchronous Internet market environment and investigate how various market design factors including dealer inventory policies, market communication patterns, and agent learning strategies affect the computational market efficiency, market liquidity, and implementation. We prove finite convergence to an optimal solution under these various schemes, where individual rational and budget-balanced trading leads to an efficient auction outcome. Empirical investigations further show that the algorithmic implementation is robust to a number of dealer and agent manipulations and scalable to larger sizes and more complicated bundle trading markets. Interestingly, we find that, though both asynchronous communication and asymmetric market information negatively affect the speed of market convergence and lead to more agent welfare loss, agents' ability to predict market prices has a positive effect on both. Contrary to conventional wisdom that a dealer's intertemporal liquidity provisions improve market performance, we find that the dealer's active market intervention may not be desirable in a simple market trading environment where an inherent market liquidity effect dominates, especially when the dealer owns a significant amount of resources. Different from the traditional market insight, our trading data suggest that high trading volume does not correlate to low price volatility and quicker price discovery.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:orisre:v:23:y:2012:i:3-part-1:p:823-843
    DOI: 10.1287/isre.1110.0366
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/isre.1110.0366
    Download Restriction: no
    File URL: https://libkey.io/10.1287/isre.1110.0366?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
    ---><---

    References listed on IDEAS

    as
    1. Nisan, Noam & Ronen, Amir, 2001. "Algorithmic Mechanism Design," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 166-196, April.
    2. Yossi Sheffi, 2004. "Combinatorial Auctions in the Procurement of Transportation Services," Interfaces, INFORMS, vol. 34(4), pages 245-252, August.
    3. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    4. 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.
    5. McCabe, Kevin A. & Rassenti, Stephen J. & Smith, Vernon L., 1990. "Auction design for composite goods : The natural gas industry," Journal of Economic Behavior & Organization, Elsevier, vol. 14(1), pages 127-149, September.
    6. 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.
    7. Peter Cramton, 1997. "The FCC Spectrum Auctions: An Early Assessment," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 6(3), pages 431-495, September.
    8. Michael H. Rothkopf, 2007. "Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical," Operations Research, INFORMS, vol. 55(2), pages 191-197, April.
    9. McAfee, R. Preston, 1992. "A dominant strategy double auction," Journal of Economic Theory, Elsevier, vol. 56(2), pages 434-450, April.
    10. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    11. 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.
    12. McAfee, R. Preston, 1991. "Efficient allocation with continuous quantities," Journal of Economic Theory, Elsevier, vol. 53(1), pages 51-74, February.
    13. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    14. Martin Bichler & Pasha Shabalin & Alexander Pikovsky, 2009. "A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats," Information Systems Research, INFORMS, vol. 20(1), pages 33-59, March.
    15. Bikhchandani, Sushil & Mamer, John W., 1997. "Competitive Equilibrium in an Exchange Economy with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 74(2), pages 385-413, June.
    16. Jérémie Gallien & Lawrence M. Wein, 2005. "A Smart Market for Industrial Procurement with Capacity Constraints," Management Science, INFORMS, vol. 51(1), pages 76-91, January.
    17. 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.
    18. Panagiotis Thomas & Demosthenis Teneketzis & Jeffrey K. Mackie-Mason, 2002. "A Market-Based Approach to Optimal Resource Allocation in Integrated-Services Connection-Oriented Networks," Operations Research, INFORMS, vol. 50(4), pages 603-616, August.
    19. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    20. 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.
    21. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2007. "A Market-Based Optimization Algorithm for Distributed Systems," Management Science, INFORMS, vol. 53(8), pages 1345-1358, August.
    22. Leonard, Herman B, 1983. "Elicitation of Honest Preferences for the Assignment of Individuals to Positions," Journal of Political Economy, University of Chicago Press, vol. 91(3), pages 461-479, June.
    23. John F. Raffensperger & Mark W. Milke & E. Grant Read, 2009. "A Deterministic Smart Market Model for Groundwater," Operations Research, INFORMS, vol. 57(6), pages 1333-1346, December.
    24. Leon Yang Chu, 2009. "Truthful Bundle/Multiunit Double Auctions," Management Science, INFORMS, vol. 55(7), pages 1184-1198, July.
    25. Marschak, Thomas, 2006. "Organization Structure," MPRA Paper 81518, University Library of Munich, Germany.
    26. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    27. de Vries, Sven & Schummer, James & Vohra, Rakesh V., 2007. "On ascending Vickrey auctions for heterogeneous objects," Journal of Economic Theory, Elsevier, vol. 132(1), pages 95-118, January.
    28. Amihud, Yakov & Mendelson, Haim, 1980. "Dealership market : Market-making with inventory," Journal of Financial Economics, Elsevier, vol. 8(1), pages 31-53, March.
    29. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
    30. 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.
    31. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    32. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bichler, Martin & Grimm, Veronika & Kretschmer, Sandra & Sutterer, Paul, 2020. "Market design for renewable energy auctions: An analysis of alternative auction formats," Energy Economics, Elsevier, vol. 92(C).
    2. Philipp N. Herrmann & Dennis O. Kundisch & Mohammad S. Rahman, 2015. "Beating Irrationality: Does Delegating to IT Alleviate the Sunk Cost Effect?," Management Science, INFORMS, vol. 61(4), pages 831-850, April.
    3. Yabing Jiang & Hong Guo, 2015. "Design of Consumer Review Systems and Product Pricing," Information Systems Research, INFORMS, vol. 26(4), pages 714-730, December.
    4. Karthik Kannan & Vandith Pamuru & Yaroslav Rosokha, 2023. "Analyzing Frictions in Generalized Second-Price Auction Markets," Information Systems Research, INFORMS, vol. 34(4), pages 1437-1454, December.
    5. Martin Bichler & Johannes Knörr & Felipe Maldonado, 2023. "Pricing in Nonconvex Markets: How to Price Electricity in the Presence of Demand Response," Information Systems Research, INFORMS, vol. 34(2), pages 652-675, June.
    6. Anselma Wörner & Verena Tiefenbeck & Felix Wortmann & Arne Meeuw & Liliane Ableitner & Elgar Fleisch & Inês Azevedo, 2022. "Bidding on a Peer-to-Peer Energy Market: An Exploratory Field Study," Information Systems Research, INFORMS, vol. 33(3), pages 794-808, September.
    7. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, December.
    8. Manahov, Viktor & Urquhart, Andrew, 2021. "The efficiency of Bitcoin: A strongly typed genetic programming approach to smart electronic Bitcoin markets," International Review of Financial Analysis, Elsevier, vol. 73(C).

    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. Martin Bichler & Pasha Shabalin & Georg Ziegler, 2013. "Efficiency with Linear Prices? A Game-Theoretical and Computational Analysis of the Combinatorial Clock Auction," Information Systems Research, INFORMS, vol. 24(2), pages 394-417, June.
    2. Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    3. 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.
    4. Pallab Sanyal, 2016. "Characteristics and Economic Consequences of Jump Bids in Combinatorial Auctions," Information Systems Research, INFORMS, vol. 27(2), pages 347-364, June.
    5. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    6. Martin Bichler & Pasha Shabalin & Alexander Pikovsky, 2009. "A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats," Information Systems Research, INFORMS, vol. 20(1), pages 33-59, March.
    7. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    8. Ioannis Petrakis & Georg Ziegler & Martin Bichler, 2013. "Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules," Information Systems Research, INFORMS, vol. 24(3), pages 768-786, September.
    9. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, December.
    10. 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.
    11. Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
    12. Leon Yang Chu, 2009. "Truthful Bundle/Multiunit Double Auctions," Management Science, INFORMS, vol. 55(7), pages 1184-1198, July.
    13. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    14. 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.
    15. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    16. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    17. 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.
    18. 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.
    19. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    20. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.

    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:inm:orisre:v:23:y:2012:i:3-part-1:p:823-843. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.