Indicators system of China’s computer manufacturing enterprises of listed companies in Shanghai and Shenzhen can be established to reflect the efficiency of production, which accord to the number of employees, fixed assets and other economic data. Integrated data envelopment analysis (DEA) models are used, combining with evaluation and statistical tests of Synthetic Average method, Borda method...

Recent research reveals that many NP-hard voting problems in general become polynomial-time solvable in single-peaked elections. In contrast to these results, we prove for the first time that constructive control by adding/deleting votes for Borda are NP-hard even in single-peaked elections. On the other side, we prove that constructive control by adding/deleting votes/candidates for Borda are ...

We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin ...

Given a preference profile, a social dichotomy function partitions the set of alternatives into a set of approved alternatives and a set of disapproved alternatives. The Borda mean rule approves all alternatives with above-average Borda score, and disapproves alternatives with below-average Borda score. We show that the Borda mean rule is the unique social dichotomy function satisfying neutrali...

One important issue in the theory of Ordered Weighted Averaging (OWA) operators is the determination of the associated weights. One of the first approaches, suggested by O’Hagan, determines a special class of OWA operators having maximal Shannon entropy of the OWA weights for a given level of orness; algorithmically it is based on the solution of a constrained optimization problem. In this pape...

In this work we deal with the problem of using OWA operators in color image reduction algorithms. For this reason, we study OWA operators defined on an arbitrary finite lattice endowed with a t-norm and a t-conorm. In the case of RGB color images, we apply OWA operators defined on a finite product lattice. Depending on the OWA operator considered, we see that the reduced images become brighter ...

The Nearest Neighbor (NN) algorithm is a well-known and effective classification algorithm. Prototype Selection (PS), which provides NN with a good training set to pick its neighbors from, is an important topic as NN is highly susceptible to noisy data. Accurate state-of-the-art PS methods are generally slow, which motivates us to propose a new PS method, called OWA-FRPS. Based on the Ordered W...

Both weighted and unweighted Borda manipulation problems have been proved NP-hard. However, there is no exact combinatorial algorithm known for these problems. In this paper, we initiate the study of exact combinatorial algorithms for both weighted and unweighted Borda manipulation problems. More precisely, we propose O∗((m · 2)) time andO∗(t2m) time combinatorial algorithms for weighted and un...

Yager’s ordered weighted averaging (OWA) operator has been widely used in soft decision making to aggregate experts’ individual opinions or preferences for achieving an overall decision. The traditional Yager’s OWA operator focuses exclusively on the aggregation of crisp numbers. However, human experts usually tend to express their opinions or preferences in a very natural way via linguistic te...

The maximal entropy ordered weighted averaging (ME-OWA)-based decision making trial and evaluation laboratory (DEMATEL) method for reliability allocation has been examined. The assessment results show that most conventional reliability allocation methods have five fundamental problems. The first problem is the measurement scale; while the second problem is that the system allocation factors are...