The incentive compatibility constraint for the innovator is given by
V(0, θ, θ, δ (0)) ≥ max V(0, fl, θ, δ (fl)), (16)
θ∈[o,θ] v 7
and the incentive compatibility constraint for the competitor is given by
Vc(0,0,0,δ (0)) ≥ max Vc(0,0,0c,δ (0)). (17)
θc∈[o,θ]
We denote the sum of the payoffs to the innovator and the competitor by
V (0) = V (0,0,0, δ (0)) + Vc (0,0,0, δ (0)).
The bribe-proofness constraint is now given by
V (0) ≥ max [V(0, 0,0c,δ (0)) + Vc(0, 0,0c,δ (fl))] .
θ,θ l ' ' ' ' j
The social planner’s payoffs in the truth-telling equilibrium are now given by
W = ʃ {δ(0)[τ(0) Sm(0) + (l - f(fl)) S(0) - K]} dF (0), (18)
where
f(fl) = τ (0)+ τc (0) .
The social planner’s problem is to maximize (18) subject to (15), (16), (17), and the analogs
of the voluntary participation and no money pump constraints. We now show the proposition that
characterizes the social planner’s problem.
Proposition 4. (Optimality of patents with bribes) The solution to the social planner’s prob-
lem with bribes coincides with that in the environment with no market signals problem. In particular,
the solution to the social planner’s problem coincides with the outcome described in Proposition 1.,
in that the interim-efficient mechanism has no prizes T (0) = 0, Vfl, and a constant patent length
τ (0) = τ, V0.
Proof. Consider a relaxed version of the social planner’s problem which does not impose the
individual incentive compatibility constraints and which replaces the voluntary participation and
17
More intriguing information
1. The name is absent2. The name is absent
3. The name is absent
4. Menarchial Age of Secondary School Girls in Urban and Rural Areas of Rivers State, Nigeria
5. The name is absent
6. The Shepherd Sinfonia
7. An Intertemporal Benchmark Model for Turkey’s Current Account
8. Gender stereotyping and wage discrimination among Italian graduates
9. Unilateral Actions the Case of International Environmental Problems
10. AN ANALYTICAL METHOD TO CALCULATE THE ERGODIC AND DIFFERENCE MATRICES OF THE DISCOUNTED MARKOV DECISION PROCESSES