Abstract Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by number authors to examine two‐stage processes, where all outputs from first stage are only inputs second stage. The current article examines and extends these models using game theory concepts. resulting linear, imply an decomposition overall process product efficiencies two individual stages. When there one intermediate measure connecting...

Abstract Data Envelopment Analysis (DEA) is a mathematical programming approach to assessing relative efficiencies within group of Decision Making Units (DMUs). An important outcome such an analysis set virtual multipliers or weights accorded each (input output) factor taken into account. These sets are, typically, different for the participating DMUs. A version DEA model offered where bounds are imposed on weights, thus reducing variation in importance same by various Techniques locating...

This paper presents a general model for aggregating votes from preferential ballot. The thrust of the is to accord each candidate fair assessment in terms his overall standing vis-a-vis first place, second …, kth place votes. form combined index Σ j = 1 k W v ij where number jth received by ith candidate. weights are assumed monotonically decreasing sequence with − + ≥ d(j, ε). These constraints correspond assurance region (AR) side DEA framework. properties examined this discrimination...

In this paper, we examine the cross-efficiency concept in data envelopment analysis (DEA). Cross efficiency links one decision-making unit's (DMU) performance with others and has appeal that scores arise from peer evaluation. However, a number of current approaches are flawed because they use arbitrary depend on particular set optimal DEA weights generated by computer code at time. One (possibly out many alternate optima) may improve cross some DMUs, but expense others. While models have...

This paper investigates the problem of combining ordinal preferences, expressed as priority vectors, to form a consensus. An axiomatic structure relating concept distance between rankings is developed, uniqueness measure proven and its derived. Adopting median ranking consensus, it shown that this can be determined, in case complete rankings, by solving certain assignment problem. The results are compared contrasted earlier work due Arrow, Kendall, Kemeny Snell, Bogart.

In conventional ordinal ranking models the voter/ranker supplies an ordered set of preferences on a collection objects without specifying any form intensity preference. For example, executive committee ten members is required to assign five candidates positions. The nature positions such that position one requires highest qualified candidate (relative given attribute), two second person and so on. Each in required, therefore, supply from each individual preference must come up with aggregate...