Royalty Licensing

Published as an article in: Economics Letters, 2010, vol. 107, issue 2, pages 284-287.

Two-part tariff licensing mechanisms

Most of the patent licensing agreements that are observed include royalties, in particular per-unit or ad valorem royalties. This paper shows that in a differ entiated duopoly that competes á la Cournot the optimal contract for an internal patentee always includes a positive royalty. Moreover, we show that the patentee would prefer to use ad valorem royalties rather than per-unit royalties when goods are complements or when they are substitutes and the degree of differentiation is suffciently low. The reason is that by including an ad valorem royalty in the licensing contract the patentee can commit strategically to be more (less) aggressive when goods are complements (substitutes) since his licensing revenues become increasing with the price of output of his rival. As a result, licensing may hurt consumers although it always increases social welfare.

Quota and Licensing Systems in the VIII Division European Anchovy

Paper presented at 12th Annual Conference of EAERE 2003 Bilbao (Spain)

Basque nominalizations and the role of structural Case in the licensing of null arguments

[EN] This article investigates the question of the licensing of null arguments in the so-called pro-drop languages. By focusing on the licensing of null subjects in the different types of -T(Z)E nominalizations in Basque, it aims at defining in a precise way the crucial feature that makes pro-drop possible in a clause. The central claim is that what licenses subject-drop is the assignment of structural Case. That is, it is argued that a subject can be null if and only if it is assigned structural Case. Different aspects of T(Z)E nominalizations are also explored, which show that even if these clauses are similar in the surface, they can be syntactically very different and furthermore, that infinitive clauses marked with the same nominalizing morpheme can also have diverging structures.

Classified one-step modified signed-digit arithmetic and its optical implementation

Based on the two-step modified signed-digit (MSD) algorithm, we present a one-step algorithm for the parallel addition and subtraction of two MSD numbers. This algorithm is reached by classifying the three neighboring digit pairs into 10 groups and then making a decision on the groups. It has only a look-up truth table, and can be further formulated by eight computation rules. A joint spatial encoding technique is developed to represent both the input data and the computation rules. Furthermore, an optical correlation architecture is suggested to implement the MSD adder in parallel. An experimental demonstration is also given. (C) 1996 Society of Photo-Optical instrumentation Engineers.