A generic Negotiation Game (NG) is used to model a conflict between two parties seeking to resolve their differences and reach a settlement. NG is a 2 × 2 non-constant-sum symmetric game that is `generic' in the sense that its payoffs, which are assumed to be cardinal, are only incompletely...

Ordinally single-peaked preferences are distinguished from cardinally single-peaked preferences, in which all players have a similar perception of distances in some one-dimensional ordering. While ordinal single-peakedness can lead to disconnected coalitions that have a ‘hole’ in...

Riker's `size principle' predicts that only minimal winning coalitions (MWCs) will form in n-person zero-sum games that satisfy certain conditions. After summarizing the logic of this principle, a model is proposed in which n players can be ordered from most to least weighty. Two different kinds...

Using a recent article by Monroe as a springboard, we extend and generalize his system of proportional representation (PR) by developing a general method for determining a set of winners from the ballots. Central to our analysis is the use of integer programming, which is a type of linear...