EconPapers    
Economics at your fingertips  
 

R&D-Hindering Collusion

Emanuele Bacchiega, Luca Lambertini () and Andrea Mantovani

The B.E. Journal of Economic Analysis & Policy, 2010, vol. 10, issue 1, 15

Abstract: In an extended version of d'Aspremont and Jacquemin's (1988) R&D competition model, we identify a region where the game is a prisoner's dilemma in that region firms' optimal strategy still prescribes to invest in R&D. However, they would obtain a higher profit by not investing at all. A standard Folk Theorem argument suggests that firms implicitly tend to collude and refrain from investing in R&D when their interaction is repeated. When this happens, social welfare shrinks, but we argue that promoting joint research constitutes a remedy to the lack of innovation efforts, rather than the excess thereof.

Keywords: collusion; process innovation; social welfare (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.2202/1935-1682.2157 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.

Related works:
Working Paper: R&D-hindering collusion (2008) Downloads
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bpj:bejeap:v:10:y:2010:i:1:n:66

Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/bejeap/html

DOI: 10.2202/1935-1682.2157

Access Statistics for this article

The B.E. Journal of Economic Analysis & Policy is currently edited by Hendrik Jürges and Sandra Ludwig

More articles in The B.E. Journal of Economic Analysis & Policy from De Gruyter
Bibliographic data for series maintained by Peter Golla ().

 
Page updated 2025-03-23
Handle: RePEc:bpj:bejeap:v:10:y:2010:i:1:n:66