We consider a many-to-many matching problem with a priority structure such as the one in undergraduate course allocation. In order to incorporate course priorities, we develop a deterministic pseudo-market mechanism with priority-specific prices that is based on the approximate competitive...

We develop a novel geometric approach to mechanism design using an important result in convex analysis: the duality between a closed convex set and its support function. By deriving the support function for the set of feasible interim values we extend the well known...

An important result in convex analysis is the duality between a closed convex set and its support function. We exploit this duality to develop a novel geometric approach to mechanism design. For a general class of social choice problems we characterize the feasible set, which is closed and...