Abstract
In this paper, we consider competition between sellers offering similar items in concurrent online auctions, where each seller must set its individual auction parameters (such as the reserve price) in such a way as to attract buyers. We show that in the case of two sellers with asymmetric production costs, there exists a pure Nash equilibrium in which both sellers set reserve prices above their production costs. In addition, we show that, rather than setting a reserve price, a seller can further improve its utility by shill bidding (i.e., pretending to be a buyer in order to bid in its own auction). But, through the use of an evolutionary simulation, we show that this shill bidding introduces inefficiences within the market. However, we then go on to show that these inefficiences can be reduced when the mediating auction institution uses appropriate auction fees that deter sellers from submitting shill bids. Specifically, we compare two types of auction fees and show that, in this respect, those based on the difference between the closing price and the reserve price are more effective than the commonly used fees that are based on closing price alone.
This research was undertaken as part of the EPSRC funded project on Market-Based Control (GR/T10664/01).
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
Anthony, P., Jennings, N.R.: Developing a bidding agent for multiple heterogeneous auctions. ACM Trans. on Internet Technology 3(3), 185–217 (2003)
Bohte, S., Gerding, E., La Poutré, H.: Market-based recommendation: Agents that compete for consumer attention. ACM Trans. on Internet Technology 4, 420–448 (2004)
Burguet, R., Sákovics, J.: Imperfect competition in auction design. International Economic Review 40(1), 231–247 (1999)
Byde, A., Preist, C., Jennings, N.R.: Decision procedures for multiple auctions. In: Proc. 1st Int. Joint Conf. on Autonomous Agents and Multi-Agent Systems, Bologna, Italy, pp. 613–620. ACM Press, New York (2002)
Clearwater, S.H. (ed.): Market-Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, Singapore (1996)
Gerding, E.H., La Poutré, H.: Bilateral bargaining with multiple opportunities: Knowing your opponent’s bargaining position. IEEE Transactions on System, Man, and Cybernetics: Part C 36(1), 44–55 (2006)
Hernando-Veciana, Á.: Competition among auctioneers in large markets. Journal of Economic Theory 121, 107–127 (2005)
Kauffman, R.J., Wood, C.A.: The effects of shilling on final bid prices in online auctions. Electronic Commerce Research and Applications 4, 21–34 (2005)
Krishna, V.: Auction Theory. Academic Press, London (2002)
Preston McAfee, R.: Mechanism design by competing sellers. Econometrica 61(6), 1281–1312 (1993)
Peters, M., Severinov, S.: Competition among sellers who offer auctions instead of prices. Journal of Economic Theory 75, 141–179 (1997)
Rogers, A., David, E., Jennings, N.R.: Self organised routing for wireless micro-sensor networks. IEEE Trans. on Systems, Man and Cybernetics: Part A 35(3), 349–359 (2005)
Wang, W., Hidvégi, Z., Whinston, A.B.: Shill-proof fee (SPF) schedule: The sunscreen against seller self-collusion in online english auctions. Working Paper (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gerding, E.H., Rogers, A., Dash, R.K., Jennings, N.R. (2007). Competing Sellers in Online Markets: Reserve Prices, Shill Bidding, and Auction Fees. In: Fasli, M., Shehory, O. (eds) Agent-Mediated Electronic Commerce. Automated Negotiation and Strategy Design for Electronic Markets. TADA AMEC 2006 2006. Lecture Notes in Computer Science(), vol 4452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72502-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-72502-2_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72501-5
Online ISBN: 978-3-540-72502-2
eBook Packages: Computer ScienceComputer Science (R0)