ADVERTISEMENT



Google       

Home -> Law Blog Directory -> Patent Law Blogs -> Philip Brooks’ Patent Infringement Updates

OR PHONE (866) 635-1838 for Bankruptcy Help, (866) 635-6190 for Divorce,
(866) 635-2689 for Personal Injury or (866) 635-9402 for Criminal Defense

Find a Local Lawyer

Bankruptcy (866) 635-1838
Divorce (866) 635-6190
Personal Injury (866) 635-2689
Criminal Defense (866) 635-9402

Bookmark

Patent Law

: Philip Brooks’ Patent Infringement Updates

Patents, Search of Prior Art and Revelation of Information

By Philip Brooks

ADVERTISEMENTS

The article, of the above title, submitted for publication in December 2007 by Corinne Langinier and Philippe Marcoul states:

This paper examines the strategic non-revelation of information by innovators when applying for patents. In a model of a bilateral search of information, we show that innovators may conceal information, and that examiners make their screening intensity contingent upon the received information. We then analyze the effects of a double review policy and a policy in which examiners ex ante commit to screening efforts. The implementation of the former policy reduces strategic non-revelation, but its overall implication remains unclear. The latter policy involves equal screening intensity across all applications, requires a limited commitment power from the examiner and induces truthful revelation.

Performances within the U.S. Patent and Trademark Office (PTO) have been strongly questioned, and examiners are often accused of granting questionable patents. This may be due to their poor knowledge of relevant prior art - the existing set of related inventions - especially in new technological fields, as was the case in e-commerce at the beginning of 2000 or is now the case in nanotechnology (Sampat, 2005). Sampat (2005) finds strong evidence that supports the fact that examiners are less informed than innovators about relevant prior art in nanotechnology, and face particular challenges in searching for it. On the other hand, according to Alcacer and Gittelman (2006), over the period 2001-2003, forty percent of patents had all citations (i.e., prior art information) listed by examiners. In other words, innovators initially applied for patents with no prior art in less than half of the patents studied.These empirical observations suggest, in a non-exclusive way, that patent applicants may not have the proper incentives to search and reveal prior art, and examiners may also have a hard time finding the relevant prior art in some fields.

In this paper we investigate the determinants of patent quality by focusing on the processes employed both by innovators and patent examiners in gathering information. We analyze the patenting process as a sequential bilateral information gathering game in which players have different objectives. On the applicant side, innovators search for prior art information and, if discovered, decide whether or not to reveal it. On the other hand, from the PTO’s perspective, as there is often uncertainty on patent applications, the ultimate goal of the PTO is to reject non-patentable innovations and accept patentable ones.

Read the full paper here.

Full post as published by Philip Brooks’ Patent Infringement Updates on September 03, 2008 (boomark / email).

Bloggers, promote your law blog by nominating your blog for inclusion in USLaw.com's Law Blog Directory and RSS Reader. Benefits described.
Related Law Articles

Lawsuits and Settlements

Related Searches

























































































































US Law
#1 Online Legal Resource













Your Blog Subscriptions
Subscribe to blogs

10,000+ Law Job Listings
Lawyer . Police . Paralegal . Etc
Earn a law-related degree
Are you the author of this blog? Adding USLaw.com to your Blogroll increases relevance. You qualify to display a USLaw Network badge.
Suggest changes to this blog's description or nominate another for inclusion. Register for updates.


Practice Area
Zip Code:

Contact a Lawyer Now!






0.0149 secs (new cache)