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...

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...

Vote-trading is common practice in committees and group decision-making. Yet we know very little about its properties. Inspired by the similarity between the logic of sequential rounds of pairwise vote-trading and matching algorithms, we explore three central questions that have parallels in the...