Efficient and Nearly-Efficient Partnerships

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

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

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

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

منابع مشابه

Secret Contracts for Efficient Partnerships∗

By allocating different information to team members, secret contracts can provide better incentives to perform with an intuitive organizational design. For instance, they may help to monitor monitors, and attain approximately efficient partnerships by appointing a secret principal. More generally, secret contracts highlight a rich duality between enforceability and identifiability. It naturally...

متن کامل

Efficient GMM with nearly-weak identification

This paper is in the line of the recent literature on weak instruments, which, following the seminal approach of Staiger and Stock (1997) and Stock and Wright (2000) captures weak identification by drifting population moment conditions. In contrast with most of the existing literature, we do not specify a priori which parameters are strongly or weakly identified. We rather consider that weaknes...

متن کامل

Efficient dissolution of partnerships and the structure of control

Past work has shown that asymmetric information and asymmetric ownership affect the possibility of efficient dissolution of partnerships. We show in this paper that control is also a central determinant of the possibility of efficient implementation. We demonstrate this point by analyzing a benchmark case of asymmetric control where a single partner exercises complete control under the status q...

متن کامل

A fast and efficient nearly-optimal adaptive Fano coding scheme

Adaptive coding techniques have been increasingly used in lossless data compression. They are suitable for a wide range of applications, in which on-line compression is required, including communications, internet, e-mail, and e-commerce. In this paper, we present an adaptive Fano coding method applicable to binary and multi-symbol code alphabets. We introduce the corresponding partitioning pro...

متن کامل

Efficient Nearly Orthogonal and Space-Filling Latin Hypercubes

This article presents an algorithm for constructing orthogonal Latin hypercubes, given a fixed sample size, in more dimensions than previous approaches. In addition, we detail a method that dramatically improves the space-filling properties of the resultant Latin hypercubes at the expense of inducing small correlations between the columns in the design matrix. Although the designs are applicabl...

متن کامل

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


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

ژورنال

عنوان ژورنال: The Review of Economic Studies

سال: 1993

ISSN: 0034-6527

DOI: 10.2307/2298126