Assume that players strictly rank each other as coalition partners. We propose a procedure whereby they "fall back" on their preferences, yielding internally compatible, or coherent, majority coalition(s), which we call fallback coalitions. If there is more than one fallback coalition, the...

This paper provides a first insight into cost sharing rules for the continuous knapsack problem. Assuming a set of divisible items with weights from which a knapsack with a certain weight constraint is to be filled, different such (classes of) rules are discussed. Those - based on individual...

We show that a cooperative outcome — one that is at least next-best for the players — is not a Nash equilibrium (NE) in 19 of the 57 2 x 2 strict ordinal conflict games (33%), including Prisoners’ Dilemma and Chicken. Auspiciously, in 16 of these games (84%), cooperative outcomes are...

We show that a cooperative outcome—one that is at least next-best for the players—is not a Nash equilibrium (NE) in 19 of the 57 2 x 2 strict ordinal conflict games (33%), including Prisoners' Dilemma and Chicken. Auspiciously, in 16 of these games (84%), cooperative outcomes are nonmyopic...

Assume that players strictly rank each other as coalition partners. We propose a procedure whereby they 'fall back' on their preferences, yielding internally compatible, or coherent, majority coalition(s), which we call fallback coalitions. If there is more than one fallback coalition, the...