Optimal Dynamic R&D Programs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RD-flatness and RD-injectivity

It is proved that every commutative ring whose RD-injective modules are Σ-RD-injective is the product of a pure semi-simple ring and a finite ring. A complete characterization of commutative rings for which each artinian (respectively simple) module is RD-injective, is given. These results can be obtained by using the properties of RD-flat modules and RD-coflat modules which are respectively th...

متن کامل

Optimal Corporate Leniency Programs∗

This study characterizes the corporate leniency policy that minimizes the frequency with which collusion occurs. Though it can be optimal to provide only partial leniency, plausible sufficient conditions are provided whereby the antitrust authority should waive all penalties for the first firm to come forward. It is also shown that restrictions should be placed on when amnesty is awarded, thoug...

متن کامل

RD: Resilient Dynamic Desynchronization for TDMA over Lossy Networks

We present a distributed TDMA negotiation approach for single-hop ad-hoc network communication. It is distributed, resilient to arbitrary transient packet loss and defines a non-overlapping TDMA schedule without the need of global time synchronization. A participating node can dynamically request a fraction of the static TDMA period T . It will receive its fraction if enough time resources are ...

متن کامل

Optimal Welfare-to-Work Programs

A Welfare-to-Work (WTW) program is a scheme of government expenditures on “passive” (unemployment compensation, social assistance) and “active” (job search monitoring, training, wage subsidies) labor market policies targeted to the unemployed. This paper studies the optimal WTW program as a recursive contract between a cost-minimizing government and a worker whose human capital depreciates duri...

متن کامل

Minimal Programs Are Almost Optimal

According to the Algorithmic Coding Theorem, minimal programs of any universal machine are prefix-codes asymptotically optimal with respect to the machine algorithmic probabilities. A stronger version of this result will be proven for a class of machines, not necessarily universal, and any semi-distribution. Furthermore, minimal programs with respect to universal machines will be shown to be al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The RAND Journal of Economics

سال: 1986

ISSN: 0741-6261

DOI: 10.2307/2555483