Mechanism design with agents who do not have quasi-linear preferences is an important line of research in social choice theory. Finding domains which admit truthful mechanisms is of central importance, particularly due to the well known impossibility result by Gibbard and Satterthwaite. In this paper we introduce a general framework for combinatorial assignments without money but with public va...

In this paper we develop a model for small scale examination scheduling. Beginning with a formulation of a quadratic assignment problem we show the transformation into a quadratic semi assignment problem and its application to a real world situation. Using simulated annealing we demonstrate the model's ability to generate schedules that satisfy student as well as university expectations.

We present a 1 − 1 √ k -competitive algorithm for the online stochastic generalized assignment problem under the assumption that no item takes up more than 1 k fraction of the capacity of any bin. Items arrive online; each item has a value and a size; upon arrival, an item can be placed in a bin or discarded; the objective is to maximize the total value of the placement. Both value and size of ...

The distance-two labeling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and nonconsecutive integers...

We consider special cases of the quadratic assignment problem (QAP) that are linearizable in the sense of Bookhold. We provide combinatorial characterizations of the linearizable instances of the weighted feedback arc set QAP, and of the linearizable instances of the traveling salesman QAP. As a by-product, this yields a new well-solvable special case of the weighted feedback arc set problem.