Discriminatory Solutions for (n,n-2)-Games.
Abstract
An (n,m)-game is an n-person game in which all coalitions with less than m players are not vital. A p-discriminatory solution to a game is a von Neumann-Morgenstern stable set solution in which some p players always receive fixed payoffs. In the paper, necessary and sufficient conditions are given for an arbitrary (n,n-2)-game to have a k-discriminatory solution. These conditions are used to characterize all 2-discriminatory solutions for 4-person games, and for the simple (n,n-2)-games in which all coalitions with at least n-2 players are winning coalitions. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1973
- Accession Number
- AD0757667
Entities
People
- Robert James Weber
Organizations
- Cornell University