We propose a modification to the concept of the potential of agame à la Hart-Mas Colell to determine a salary system for theassignment problem. We obtain explicit formulas for the potentialof the assignment problem and for it's corresponding salarysystem. Also, we establish some properties of...

This paper addresses scheduling models in which a contribution of an individual job to the objective function is represented by the product of its processing time and a certain positional weight. We review most of the known results in the area and demonstrate that a linear assignment algorithm...

In recent years, there has been a proliferation of database systems in all types of organizations. In many cases, these databases are developed in different departments and maintained autonomously. Much is to be gained, however, if databases across departments, divisions, or even organizations...

We discuss in an informal, general audience style the da Costa-Doria conjecture about the independence of the P = NP hypothesis and try to briefly assess its impact on practical situations in economics. The paper concludes with a discussion of the Coppe-Cosenza procedure, which is an...

This note formulates an assignment problem for obtaining optimal level schedules for mixed-model assembly lines in JIT production systems. The problem was formulated as a quadratic integer programming problem in a recent paper by Miltenburg (1989) where, however, only enumerative algorithms and...

In many public sector location problems, it is often desirable to locate facilities in such a way to minimize the number (or cost) of facilities while insuring tint all demand centers are within a stated maximal service time front any facility. However, when insufficient resources exist to allow...

We study a labor market with finitely many heterogeneous workers and firms to illustrate the decentralized (myopic) blocking dynamics in two-sided one-to-one matching markets with continuous side payments (assignment problems, Shapley and Shubik, 1971). A labor market is unstable if there is at...

LetG=(U,V,E) be a bipartite graph with weights of its edgesc ij . For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E o is the set of edgesij withx ij =0 for each optimum solution (0-persistent...

We describe the two-to-one assignment problem, a problem in between the axial three-index assignment problem and the three-dimensional matching problem, having applications in various domains. For the (relevant) case of decomposable costs satisfying the triangle inequality we provide, on the...

In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random serial dictatorship (RSD) is a well-known generalization of random dictatorship that...