Learning and collusion in new markets with uncertain entry costs

Show simple item record

dc.contributor.author Bloch, F en
dc.contributor.author Fabrizi, Simona en
dc.contributor.author Lippert, Steffen en
dc.date.accessioned 2018-10-19T01:03:58Z en
dc.date.issued 2014 en
dc.identifier.uri http://hdl.handle.net/2292/42925 en
dc.description.abstract When new opportunities appear – the development of new products, to enter new geographic markets – firms begin to acquire information. They gradually assess these new events through studying the markets and testing products. Only once they have become sure that the new market is profitable do they decide to enter it. While such a strategy is clear for a firm that has a monopoly, it is much less clear in an oligopoly where two competing firms acquire information independently and secretly about the fixed costs of entry. In this theoretical article, Bloch, Fabrizi and Lippert study a competitive learning model. A firm sees that its competitor has not gone into a new market, and does not know whether it took that decision after observing a negative signal, or simply on the basis of not having any information about the cost involved. As time passes, the probablility that no information has been received diminishes and the firm becomes more and more optimistic about its future profits. Thus, at a set time, it chooses to enter the market even if it has still not received any signal about the entry cost. This is also how the model leads, like the 1985 Fudenberg and Tirole model, to a pre-emption equilibrium; however, this equilibrium is due not to a exogenous change in costs as in the latter model, but to an endogenous change in beliefs. The authors then examine the collusion. How can firms avoid full-frontal competition on the new market and come to an understanding about the sharing of profits? This question is especially thorny when the firms do not know which of the two has the lowest entry costs, and when information about the costs is acquired gradually and in hidden fashion. A netting agreement allows a firm that has entered the market to pay its competitor to remain outside that market. But this compensation is necessarily inflated – because the firm does not know whether its competitor has received a negative signal or not. The more time passes, the more a firm appears reticent to compensate a competitor for which it thinks there is a strong possibility that the cost of entry would be too high for it to threaten the market. These netting agreements can only be efficient if a leading firm receives a positive signal about the cost of entry early enough. To put it another way, a compensation agreement between two firms is only possible if the difference in information between them is not too great; in addition, the agreement must give to the second firm a proportion of the profits sufficient to equalise them (the “leader” and the “follower”) and thus reduce excessive pre-emption on the market. en
dc.publisher Paris School of Economics, ‘Economics for Everyone: 5 papers... in 5 minutes.’ en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title Learning and collusion in new markets with uncertain entry costs en
dc.type Internet Publication en
dc.rights.holder Copyright: The author en
pubs.author-url https://www.parisschoolofeconomics.eu/en/economics-for-everyone/for-a-wider-audience/5-papers-in-5-minutes/november-2014/learning-and-collusion-in-new-markets-with-uncertain-entry-costs en
dc.rights.accessrights http://purl.org/eprint/accessRights/RestrictedAccess en
pubs.elements-id 692214 en
pubs.org-id Business and Economics en
pubs.org-id Economics en
pubs.record-created-at-source-date 2017-10-13 en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics