A note on assignment games with the same nucleolus
Tóm tắt
We show that the family of assignment matrices which give rise to the same nucleolus forms a compact join-semilattice with one maximal element. The above family is, in general, not a convex set, but path-connected.
Tài liệu tham khảo
Greco G, Malizia E, Palopoli L, Scarcello F (2015) The complexity of the nucleolus in compact games. ACM Trans Comput Theory (TOCT) 7(1):3
Llerena F, Núñez M (2011) A geometric characterization of the nucleolus of the assignment game. Econ Bull 31(4):3275–3285
Llerena F, Núñez M, Rafels C (2015) An axiomatization of the nucleolus of assignment games. Int J Game Theory 44:1–15
Martínez-de-Albéniz FJ, Rafels C, Ybern N (2013a) On the nucleolus of \(2 \times 2\) assignment games. Econ Bull 33(2):1641–1648
Martínez-de-Albéniz FJ, Rafels C, Ybern N (2013b) A procedure to compute the nucleolus of the assignment game. Oper Res Lett 41:675–678
Martínez-de-Albéniz FJ, Rafels C, Ybern N (2015) Insights into the nucleolus of the assignment game. Working paper E15/333 Universitat de Barcelona, pp 1–32
Núñez M (2004) A note on the nucleolus and the kernel of the assignment game. Int J Game Theory 33:55–65
Núñez M, Rafels C (2002) Buyer-seller exactness in the assignment game. Int J Game Theory 31:423–436
Núñez M, Rafels C (2015) A survey on assignment markets. J Dyn Games 3&4:227–256
Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17:1163–1170
Shapley LS, Shubik M (1972) The assignment game I: the core. Int J Game Theory 1:111–130
Solymosi T, Raghavan TES (1994) An algorithm for finding the nucleolus of assignment games. Int J Game Theory 23:119–143
Topkis DM (1998) Supermodularity and complementarity. Princeton University Press, Princeton