Abstract
A considerable amount of work has been done on n-person games in which all coalitions with less than n-1 players are totally defeated. Maschler [3] has studied the structure of their bargaining sets, while Lucas, in two separate papers [1], [2] has given a symmetric solution to such games and studied the behavior of solutions for such games in partition function form. In this paper, we propose to give all discriminatory solutions to such games. We consider here n-person games, v, satisfying
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
