skip to main content
research-article

Analysis of single and networked auctions

Published:11 May 2009Publication History
Skip Abstract Section

Abstract

Web-based computerized auctions are increasingly present in the Internet. We can imagine that in the future this trend will actually be extended to situations where virtual buyer and seller agents will conduct automated transactions across the network, and that large sectors of the economy may be strucured in this manner. The purpose of this article is to model automated bidders and sellers which interact through a network. We model the bidding process as a random arrival process while the price attained by a good is modeled as a discrete random variable. We obtain analytical solutions allowing us to compute the income from a single auction, or the income per unit time from a repeated sequence of auctions. A variety of single-auction models are studied, including English and Vickrey auctions, and the income per unit time is derived as a function of other parameters, including the rate of arrival of bids, the seller's decision time, the value of the good, and the “rest time” of the seller between successive auctions. We illustrate the results via numerical examples. We also introduce a model for networked auctions where bidders can circulate among a set of interconnected auctions which we call the Mobile Bidder Model (MBM). We obtain an analytical solution for the MBM under the assumption,which we call the “active bidders assumption,” that activities that are internal to an auction (bids and sales) are much more frequent than changes that occur in the number of bidders at each auction.

References

  1. Chow, Y. S., Moriguti, S., Robbins, H., and Samuels, S. M. 1964. Optimal selection based on relative rank (the secretary problem). Israel J. Math. 2, 81--90.Google ScholarGoogle ScholarCross RefCross Ref
  2. Das, N. R., Jennings, N. R., and Parkes, D. C. 2003. Computational mechanism design: A call to arms. IEEE Intell. Syst., 40--47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. David, E., Rogers, A., Schiff, J., Kraus, S., and Jennings, N. R. 2005. Optimal design of English auctions with discrete bid levels. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC'05), 98--107. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Finch, S. R. 2003. Optimal stopping constants. In Mathematical Constants, 361--363.Google ScholarGoogle Scholar
  5. Gelenbe, E. 2003. Sensible decisions based on qos. Comput. Managem. Sci. 1, 1, 1--14.Google ScholarGoogle Scholar
  6. Guo, X. 2002. An optimal strategy for sellers in an online auction. ACM Trans. Internet Tech. 2, 1, 1--13. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Hajiaghayi, M. T., Kleinberg, R., and Parkes, D. C. 2004. Adaptive limited-supply online auctions. In Proceedings of the 5th ACM Conference on Electronic Commerce, 71--90. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. McAfee, R. P. and McMillan, J. 1987. Auctions and bidding. J. Econom. Literature 25, 699--738.Google ScholarGoogle Scholar
  9. Medhi, J. 1994. Stochastic Processes, 2nd ed. Wiley Eastern Ltd., New Delhi.Google ScholarGoogle Scholar
  10. Milgrom, P. R. and Weber, R. 1982. A theory of auctions and competitive bidding. Econometrica 50, 1089--1122.Google ScholarGoogle ScholarCross RefCross Ref
  11. Shehory, O. 2009. Optimality and risk in purchase from multiple auctions. Lecture Volumes in Artificial Intelligence, vol. 2182. Springer, 142--153. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Shehory, O. 2002. Optimal bidding in multiple concurrent auctions. Int. J. Cooperative Inf. Syst. 11, 3-4, 315--327.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Analysis of single and networked auctions

                    Recommendations

                    Comments

                    Login options

                    Check if you have access through your login credentials or your institution to get full access on this article.

                    Sign in

                    Full Access

                    • Published in

                      cover image ACM Transactions on Internet Technology
                      ACM Transactions on Internet Technology  Volume 9, Issue 2
                      May 2009
                      116 pages
                      ISSN:1533-5399
                      EISSN:1557-6051
                      DOI:10.1145/1516539
                      Issue’s Table of Contents

                      Copyright © 2009 ACM

                      Publisher

                      Association for Computing Machinery

                      New York, NY, United States

                      Publication History

                      • Published: 11 May 2009
                      • Accepted: 1 March 2008
                      • Received: 1 December 2006
                      Published in toit Volume 9, Issue 2

                      Permissions

                      Request permissions about this article.

                      Request Permissions

                      Check for updates

                      Qualifiers

                      • research-article
                      • Research
                      • Refereed

                    PDF Format

                    View or Download as a PDF file.

                    PDF

                    eReader

                    View online with eReader.

                    eReader
                    About Cookies On This Site

                    We use cookies to ensure that we give you the best experience on our website.

                    Learn more

                    Got it!