Evaluating the administrative efficiency of courts
In addition to being held accountable for judicial decision, courts, like other public agencies, can and should be evaluated in terms of their administrative efficiency. This paper illustrates how courts can be evaluated in terms of their relative administrative efficiency, using a new approach--data envelopment analysis (DEA)--first proposed by Charnes et al. . The DEA is based upon the economic notion of Pareto optimality which states that a given decision making unit (DMU) is inefficient if some other DMU, or some combination of other DMUs, can produce at least the same amounts of all outputs with less of some resource input and not more of any other resource. Conversely a DMU is said to be efficient if the above is not possible. Charnes et al.  generalized the usual input/output ratio measure of efficiency for a given unit in terms of a fractional linear program with fractional constraints. In the case of courts, the efficiency of any particular court is calculated by forming the ratio of a weighted sum of outputs to a weighted sum of inputs, where the weights for both outputs and inputs are to be selected in a manner that calculates the Pareto-Koopmans efficiency of the court. This paper reviews the DEA method and illustrates its application to a data base for 100 criminal superior courts in North Carolina.
Volume (Year): 10 (1982)
Issue (Month): 4 ()
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:10:y:1982:i:4:p:401-411. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If references are entirely missing, you can add them using this form.