The reactive bargaining set for cooperative games

We introduce a new bargaining set for cooperative games in characteristic function form, and investigate its structure and properties. We prove that the new bargaining set is not empty. In fact, we show that it contains the kernel and is contained in the classical bargaining set \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{M}^i_1}$$\end{document}, and we further prove that it consists of the unique symmetric vector for the class of simple majority games.