Recently Schechter (in a Lehigh University report) formulated two dual linear programming problems over closed convex cones in quite general spaces and showed that, if precisely one of the problems is ...

We also study conditions in which the core and the set of dual payoffs coincide even without replication. We give a necessary and sufficient condition for this phenomenon and present two classes of LP ...