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

We study symmetric play in a class of repeated games when players are patient. We show that, while the use of symmetric strategy profiles essentially does not restrict the set of feasible payoffs, the set of equilibrium payoffs is an interesting proper subset of the feasible and individually...