With the application of the articulated phase insulator, and the speed of electric locomotive rising, it is inevitable for the electric locomotive to adopt the technology automatic passing through the electric phase separation. However, when the locomotive passes the electric phase separation, a variety of overvoltages will be generated, such as the cut-off overvoltage and the closing overvolta...

In this brief note we consider rank aggregation, a popular method in voting theory, social choice, business decisions etc. Mathematically the problem is to find a permutation – viewed as a vector – that minimizes the sum of the `1-distances to a given family of permutations. The problem may be solved as an assignment problem and we establish several properties of optimal solutions in this problem.

Proof of Theorem 3.3: The proof of the first part of the theorem is similar to that of Theorem 3.1, and is omitted. Next, we prove the second part of the theorem. Suppose that the state estimator (5) with 1G given by (6) is a nonfragile quadratic guaranteed cost estimator with cost matrix Q 0 , then from Lemma 3E, (31) and (44) hold for some

In this paper we prove a very general theorem and establish related results about the existence of robust multivalued solutions for assignment problems. Indian Institute of Management Ahmedabad-380 015 India and ERSA University of the Witwatersrand

We establish the soundness of the replica symmetric ansatz introduced by M. Mézard and G. Parisi for the minimum matching problem in the pseudo-dimension d mean field model for d ≥ 1. The case d = 1 corresponds to the π2/6-limit for the assignment problem proved by D. Aldous in 2001. We introduce a game-theoretical framework by which we establish the analogous limit also for d > 1.

Article history: Received 18 January 2016 Available online xxxx JEL classification: D63 D70