In a strategy-proof mechanism, implementation theory mostly assumes that each agent is rational in the sense that the agent reveals its true preference to induce its most preferred outcome. This assumption is sufficient to guarantee that the agent seeks such an outcome, but not necessary because...

For any linear transformation and two convex closed sets, we provide necessary and sufficient conditions for when the transformation of the intersection of the sets coincides with the intersection of their images. We also identify analogous conditions for non-convex sets, general...

For any linear transformation and two convex closed sets, we provide necessary and sufficient conditions for when the transformation of the intersection of the sets coincides with the intersection of their images. We also identify analogous conditions for non-convex sets, general...