Monotone second-best optimal contracts
Article Abstract:
The two stage nonlinear programming method for the principal-agent problem suggested by S.J. Grossman and O.D. Hart in 1983 is analyzed. The goal of the principal is to find an optimal payment schedule to an agent that relies only on observable outcomes when outcomes are affected by unobservable moves of the agent. These 'second-best' optimal contracts are found to be monotonically related to observable outputs under fairly mild situations. The monotone likelihood ratio condition on the probabilities of outcomes is sufficient for monotonicity of second-best optimal contracts in a three-state model.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
On the optimal spacing of currency denominations
Article Abstract:
The optimal spacing for currency denominations is proven to be two even if overpayment and the return of exchange are taken into consideration. S. Sumner's proof that the optimal spacing is three, is proven wrong by J.S. Cramer's method which only takes into account actual world currency and assumes that the public's payment behavior is efficient. However, the spacing factor of two is not practical because denominations should be compatible with the decimal system and having a large number of denominations is very inconvenient.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Optimal allocation and backup of computer resources under asymmetric information and incentive incompatibility
Article Abstract:
A model for the optimal allocation and backup of computing resources in the presence of asymmetric information and incentive incompatibility is proposed. A game-theoretic model is developed and translated into a linear programming model to determine optimal computer resource allocation. A greedy-type algorithm and an averaged version of the linear programming model are developed to obtain upper and lower bounds. The greedy-type algorithm can provide exact solutions even when sufficient conditions are not met.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Balancing product quality, costs, and profits. Consumer media as an information source for industrial products: a study
- Abstracts: More flexible office location controls and public transport considerations: a case study of the city of Manchester
- Abstracts: Monte Carlo versus Numerical Convolutions: Some Critical Remarks. An axiomatic characterization of some locations in trees
- Abstracts: Celebrating seventy-five years of the Building Research Establishment. part 2 Can the output of 200 years really be characterized by mullions?
- Abstracts: Evaluation and planning: inseparable concepts. Public consensus and planners' expertise: a twofold problem for Italian planning law