IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v51y2005i3p316-327.html
   My bibliography  Save this article

The Landscape of Electronic Market Design

Author

Listed:
  • G. Anandalingam

    (The Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815)

  • Robert W. Day

    (Operations and Information Management, School of Business, University of Connecticut, Storrs, Connecticut 06269-1041)

  • S. Raghavan

    (The Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742-1815)

Abstract

This paper presents an introductory survey for this special issue of Management Science on electronic markets. We acquaint the reader with some fundamental concepts in the study of electronic market mechanisms, while simultaneously presenting a survey and summary of the essential literature in this area. Along the way, we position each of the papers presented in this special issue within the existing literature, demonstrating the deep impact of these 14 articles on an already broad body of knowledge.

Suggested Citation

  • G. Anandalingam & Robert W. Day & S. Raghavan, 2005. "The Landscape of Electronic Market Design," Management Science, INFORMS, vol. 51(3), pages 316-327, March.
    • Handle: RePEc:inm:ormnsc:v:51:y:2005:i:3:p:316-327
    DOI: 10.1287/mnsc.1040.0345
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.1040.0345
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.1040.0345?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. Christian Terwiesch & Sergei Savin & Il-Horn Hann, 2005. "Online Haggling at a Name-Your-Own-Price Retailer: Theory and Application," Management Science, INFORMS, vol. 51(3), pages 339-351, March.
    2. Cramton, Peter & Schwartz, Jesse A, 2000. "Collusive Bidding: Lessons from the FCC Spectrum Auctions," Journal of Regulatory Economics, Springer, vol. 17(3), pages 229-252, May.
    3. Jeffrey S. Banks & John O. Ledyard & David P. Porter, 1989. "Allocating Uncertain and Unresponsive Resources: An Experimental Approach," RAND Journal of Economics, The RAND Corporation, vol. 20(1), pages 1-25, Spring.
    4. O'Neill, Richard P. & Sotkiewicz, Paul M. & Hobbs, Benjamin F. & Rothkopf, Michael H. & Stewart, William R., 2005. "Efficient market-clearing prices in markets with nonconvexities," European Journal of Operational Research, Elsevier, vol. 164(1), pages 269-285, July.
    5. 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.
    6. Colin Campbell & Gautam Ray & Waleed A. Muhanna, 2005. "Search and Collusion in Electronic Markets," Management Science, INFORMS, vol. 51(3), pages 497-507, March.
    7. Lawrence M. Ausubel & Peter Cramton & Marek Pycia & Marzena Rostek & Marek Weretka, 2014. "Demand Reduction and Inefficiency in Multi-Unit Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1366-1400.
    8. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    9. Frank Kelly & Richard Steinberg, 2000. "A Combinatorial Auction with Multiple Winners for Universal Service," Management Science, INFORMS, vol. 46(4), pages 586-596, April.
    10. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    11. John O. Ledyard & Mark Olson & David Porter & Joseph A. Swanson & David P. Torma, 2002. "The First Use of a Combined-Value Auction for Transportation Services," Interfaces, INFORMS, vol. 32(5), pages 4-12, October.
    12. 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.
    13. Lawrence Friedman, 1956. "A Competitive-Bidding Strategy," Operations Research, INFORMS, vol. 4(1), pages 104-112, February.
    14. Min Ding & Jehoshua Eliashberg & Joel Huber & Ritesh Saini, 2005. "Emotional Bidders---An Analytical and Experimental Examination of Consumers' Behavior in a Priceline-Like Reverse Auction," Management Science, INFORMS, vol. 51(3), pages 352-364, March.
    15. Cramton Peter & Schwartz Jesse A, 2002. "Collusive Bidding in the FCC Spectrum Auctions," The B.E. Journal of Economic Analysis & Policy, De Gruyter, vol. 1(1), pages 1-20, December.
    16. Rothkopf, Michael H & Harstad, Ronald M, 1995. "Two Models of Bid-Taker Cheating in Vickrey Auctions," The Journal of Business, University of Chicago Press, vol. 68(2), pages 257-267, April.
    17. Rothkopf, Michael H & Teisberg, Thomas J & Kahn, Edward P, 1990. "Why Are Vickrey Auctions Rare?," Journal of Political Economy, University of Chicago Press, vol. 98(1), pages 94-109, February.
    18. D. J. Wu & Paul R. Kleindorfer, 2005. "Competitive Options, Supply Contracting, and Electronic Markets," Management Science, INFORMS, vol. 51(3), pages 452-466, March.
    19. Richard Engelbrecht-Wiggans & Charles M. Kahn, 2005. "Low-Revenue Equilibria in Simultaneous Ascending-Bid Auctions," Management Science, INFORMS, vol. 51(3), pages 508-518, March.
    20. Rachel R. Chen & Robin O. Roundy & Rachel Q. Zhang & Ganesh Janakiraman, 2005. "Efficient Auction Mechanisms for Supply Chain Procurement," Management Science, INFORMS, vol. 51(3), pages 467-482, March.
    21. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    22. 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.
    23. 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.
    24. Gail Hohner & John Rich & Ed Ng & Grant Reid & Andrew J. Davenport & Jayant R. Kalagnanam & Ho Soo Lee & Chae An, 2003. "Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers," Interfaces, INFORMS, vol. 33(1), pages 23-35, February.
    25. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    26. Octavian Carare & Michael Rothkopf, 2005. "Slow Dutch Auctions," Management Science, INFORMS, vol. 51(3), pages 365-373, March.
    27. 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.
    28. 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.
    29. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    30. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    31. Paul R. Kleindorfer & Lide Li, 2005. "Multi-Period VaR-Constrained Portfolio Optimization with Applications to the Electric Power Sector," The Energy Journal, International Association for Energy Economics, vol. 0(Number 1), pages 1-26.
    32. Siva Viswanathan, 2005. "Competing Across Technology-Differentiated Channels: The Impact of Network Externalities and Switching Costs," Management Science, INFORMS, vol. 51(3), pages 483-496, March.
    33. Tuomas Sandholm & Subhash Suri & Andrew Gilpin & David Levine, 2005. "CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions," Management Science, INFORMS, vol. 51(3), pages 374-390, March.
    34. David Lucking-Reiley, 1999. "Using Field Experiments to Test Equivalence between Auction Formats: Magic on the Internet," American Economic Review, American Economic Association, vol. 89(5), pages 1063-1080, December.
    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. McKelvey, Bill & Wycisk, Christine & Hülsmann, Michael, 2009. "Designing an electronic auction market for complex 'smart parts' logistics: Options based on LeBaron's computational stock market," International Journal of Production Economics, Elsevier, vol. 120(2), pages 476-494, August.
    2. Shan Wang & Shi Zheng & Lida Xu & Dezheng Li & Huan Meng, 2008. "A literature review of electronic marketplace research: Themes, theories and an integrative framework," Information Systems Frontiers, Springer, vol. 10(5), pages 555-571, November.
    3. Emili GRIFELL‐TATJÉ & Kristiaan KERSTENS, 2008. "Incentive Regulation And The Role Of Convexity In Benchmarking Electricity Distribution: Economists Versus Engineers," Annals of Public and Cooperative Economics, Wiley Blackwell, vol. 79(2), pages 227-248, June.
    4. Nelson Granados & Alok Gupta & Robert J. Kauffman, 2010. "Research Commentary---Information Transparency in Business-to-Consumer Markets: Concepts, Framework, and Research Agenda," Information Systems Research, INFORMS, vol. 21(2), pages 207-226, June.
    5. Ninoslav Malekovic & Lazaros Goutas & Juliana Sutanto & Dennis Galletta, 2020. "Regret under different auction designs: the case of English and Dutch auctions," Electronic Markets, Springer;IIM University of St. Gallen, vol. 30(1), pages 151-161, March.
    6. Hanane Thamik & Jiang Wu, 2022. "The Impact of Artificial Intelligence on Sustainable Development in Electronic Markets," Sustainability, MDPI, vol. 14(6), pages 1-20, March.
    7. Aleksandar Saša Pekev{c} & Ilia Tsetlin, 2008. "Revenue Ranking of Discriminatory and Uniform Auctions with an Unknown Number of Bidders," Management Science, INFORMS, vol. 54(9), pages 1610-1623, September.
    8. Joo, Mingyu & Mazumdar, Tridib & Raj, S.P., 2012. "Bidding Strategies and Consumer Savings in NYOP Auctions," Journal of Retailing, Elsevier, vol. 88(1), pages 180-188.
    9. 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.
    10. 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.
    11. Micha Kahlen & Karsten Schroer & Wolfgang Ketter & Alok Gupta, 2024. "Smart Markets for Real-Time Allocation of Multiproduct Resources: The Case of Shared Electric Vehicles," Information Systems Research, INFORMS, vol. 35(2), pages 871-889, June.
    12. Schellhorn, Henry, 2011. "A trading mechanism contingent on several indices," European Journal of Operational Research, Elsevier, vol. 213(3), pages 551-558, September.
    13. Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
    14. Kasing Man & Junbo Wang & Chunchi Wu, 2013. "Price Discovery in the U.S. Treasury Market: Automation vs. Intermediation," Management Science, INFORMS, vol. 59(3), pages 695-714, September.
    15. 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. Jawad Abrache & Teodor Crainic & Michel Gendreau & Monia Rekik, 2007. "Combinatorial auctions," Annals of Operations Research, Springer, vol. 153(1), pages 131-164, September.
    2. Aleksandar Pekev{c} & Michael H. Rothkopf, 2003. "Combinatorial Auction Design," Management Science, INFORMS, vol. 49(11), pages 1485-1503, November.
    3. 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.
    4. 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.
    5. 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.
    6. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.
    7. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    8. 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.
    9. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
    10. 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.
    11. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    12. Michael H. Rothkopf & Sunju Park, 2001. "An Elementary Introduction to Auctions," Interfaces, INFORMS, vol. 31(6), pages 83-97, December.
    13. Gediminas Adomavicius & Shawn P. Curley & Alok Gupta & Pallab Sanyal, 2012. "Effect of Information Feedback on Bidder Behavior in Continuous Combinatorial Auctions," Management Science, INFORMS, vol. 58(4), pages 811-830, April.
    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. Tobias Scheffel & Alexander Pikovsky & Martin Bichler & Kemal Guler, 2011. "An Experimental Comparison of Linear and Nonlinear Price Combinatorial Auctions," Information Systems Research, INFORMS, vol. 22(2), pages 346-368, June.
    16. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    17. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
    18. Chen, Yan & Takeuchi, Kan, 2010. "Multi-object auctions with package bidding: An experimental comparison of Vickrey and iBEA," Games and Economic Behavior, Elsevier, vol. 68(2), pages 557-579, March.
    19. 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.
    20. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.

    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:ormnsc:v:51:y:2005:i:3:p:316-327. 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.