和光 純

Complementary slackness of a pair of dual linear programming problems implies the remark of Sotomayor (2003) that assignment games have singleton cores only when multiple optimal matchings exist.

Complementary slackness of a pair of dual linear programming problems implies the remark of Sotomayor (2003) that assignment games have singleton cores only when multiple optimal matchings exist.

We consider a barter market with multiple types of indivisible goods. Konishi et al. [J. Math. Econ. 35 (2001) 1-15] showed that the core of this market may be empty. We define a normal form game for this market and consider its equilibrium outcom...