Abstract
We study the committee decision making process using game theory. Shenoy [15] introduced two solution concepts: the one-core and the bargaining set, and showed that the one-core of a simple committee game is nonempty if there are at most four players. We extend this result by proving that whether the committee is simple or not, as far as there are less than five players, the one-core is nonempty. This result also holds for the bargaining set.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
