Abstract
Web based computerised auctions are increasingly present in the Internet, and we can imagine that in the future automated buyer and seller agents will conduct automated transactions in this manner. The purpose of this paper is to model automated bidders and sellers which interact through a computerised auction. We model bidding process using random processes with discrete state-space. We obtain analytical solutions for a variety of single auction models, including English and Vickrey auctions, and relate the income per unit time to the 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 examine how the seller’s “decision time” impacts the expected income per unit time received by the seller, and illustrate its effect via numerical examples.
This research was undertaken as part of the ALADDIN (Autonomous Learning Agents for Decentralised Data and Information Systems) project and is jointly funded by a BAE Systems and EPSRC (Engineering and Physical Research Council) strategic partnership under Grant No. EP/C548051/1.
Professor in the Dennis Gabor Chair
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chow, Y.S., Moriguti, S., Robbins, H., Samuels, S.M.: Optimal selection based on relative rank (the Secretary problem). Israel J. Math. 2, 81–90 (1964)
Gelenbe, E., Mitrani, I.: Analysis and Synthesis of Computer Systems. Academic Press, New York, London (1980)
Milgrom, P.R., Weber, R.: A theory of auctions and competitive bidding. Econometrica 50, 1089–1122 (1982)
McAfee, R.P., McMillan, J.: Auctions and bidding. J. Economic Literature 25, 699–738 (1987)
Gelenbe, E.: Learning in the recurrent random neural network. Neural Computation 5(1), 154–164 (1993)
Medhi, J.: Stochastic Processes, 2nd edn. Wiley Eastern Ltd., New Delhi (1994)
Gelenbe, E., Pujolle, G.: Introduction to Networks of Queues, 2nd edn. J. Wiley & Sons, Chichester (1998)
Shehory, O.: Optimality and risk in purchase from multiple auctions. In: Klusch, M., Zambonelli, F. (eds.) CIA 2001. LNCS (LNAI), vol. 2182, pp. 142–153. Springer, Heidelberg (2001)
Shehory, O.: Optimal bidding in multiple concurrent auctions. International Journal of Cooperative Information Systems 11(3-4), 315–327 (2002)
Finch, S.R.: Optimal stopping constants, Mathematical Constants, pp. 361–363. Cambridge Univ. Press, Cambridge (2003)
Dash, N.R., Jennings, N.R., Parkes, D.C.: Computational mechanism design: a call to arms. IEEE Intelligent Systems, 40–47 (November-December 2003)
David, E., Rogers, A., Schiff, J., Kraus, S., Jennings, N.R.: Optimal design of English auctions with discrete bid levels. In: Proc. of 6th ACM Conference on Electronic Commerce (EC 2005), Vancouver, Canada, pp. 98–107 (2005)
Fatima, S., Wooldridge, M., Jennings, N.R.: Sequential auctions for objects with common and private values. In: Proc. 4th Int Joint Conf on Autonomous Agents and Multi-Agent Systems, Utrecht, Netherlands, pp. 635–642 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gelenbe, E. (2006). Analysis of Automated Auctions . In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_1
Download citation
DOI: https://doi.org/10.1007/11902140_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-47242-1
Online ISBN: 978-3-540-47243-8
eBook Packages: Computer ScienceComputer Science (R0)