What is Fair Pay for Executives? An Information Theoretic Analysis of Wage Distributions
نویسندگان
چکیده
منابع مشابه
What is Fair Pay for Executives? An Information Theoretic Analysis of Wage Distributions
The high pay packages of U.S. CEOs have raised serious concerns about what would constitute a fair pay. Since the present economic models do not adequately address this fundamental question, we propose a new theory based on statistical mechanics and information theory. We use the principle of maximum entropy to show that the maximally fair pay distribution is lognormal under ideal conditions. T...
متن کاملWhat is information? with an Emphasis on Zins’s Views
Purpose: The aim of this paper is to explore some important views and theories of information and knowledge in the area of library and information science (LIS) and then to propose a new model of information and knowledge. Method: This research has been conducted by using a comparative content analysis of the existing materials on conceptualizations and definitions of information and knowledge...
متن کاملAn Information-Theoretic Discussion of Convolutional Bottleneck Features for Robust Speech Recognition
Convolutional Neural Networks (CNNs) have been shown their performance in speech recognition systems for extracting features, and also acoustic modeling. In addition, CNNs have been used for robust speech recognition and competitive results have been reported. Convolutive Bottleneck Network (CBN) is a kind of CNNs which has a bottleneck layer among its fully connected layers. The bottleneck fea...
متن کاملInformation-theoretic inequalities for contoured probability distributions
We show that for a special class of probability distributions that we call contoured distributions, information theoretic invariants and inequalities are equivalent to geometric invariants and inequalities of bodies in Euclidean space associated with the distributions. Using this, we obtain characterizations of contoured distributions with extremal Shannon and Renyi entropy. We also obtain a ne...
متن کاملAn information-theoretic analysis of Grover’s algorithm
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately π/4 √ N queries to a quantum oracle. For classical search using a classical oracle, the search complexity is of order N/2 queries since on average half of the items must be searched. In work preceding Grover’s, Bennett et al. had shown that no quantum algorithm c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2009
ISSN: 1099-4300
DOI: 10.3390/e11040766