We propose a new voting system, satisfaction approval voting (SAV), for multiwinner elections, in which voters can approve of as many candidates or as many parties as they like. However, the winners are not those who receive the most votes, as under approval voting (AV), but those who maximize...

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...

We propose a new voting system, satisfaction approval voting (SAV), for multiwinner elections, in which voters can approve of as many candidates or as many parties as they like. However, the winners are not those who receive the most votes, as under approval voting (AV), but those who maximize...

Many procedures have been suggested for the venerable problem of dividing a set of indivisible items between two players. We propose a new algorithm (AL), related to one proposed by Brams and Taylor (BT), which requires only that the players strictly rank items from best to worst. Unlike BT, in...

Barbanel, Brams, and Stromquist (2009) asked whether there exists a two-person moving-knife procedure that yields an envy-free, undominated, and equitable allocation of a pie. We present two procedures: One yields an envy-free, almost undominated, and almost equitable allocation, whereas the...

We distinguish between (i) voting systems in which voters can rank candidates and (ii) those in which they can grade candidates, such as approval voting, in which voters can give two grades — approve (1) or not approve (0) — to candidates. While two grades rule out a discrepancy between the...

Assume that two players have strict rankings over an even number of indivisible items. We propose algorithms to find allocations of these items that are maximin — maximize the minimum rank of the items that the players receive — and are envy-free and Pareto-optimal if such allocations exist....

Unlike tic-tac-toe or checkers, in which optimal play leads to a draw, it is not known whether optimal play in chess ends in a win for White, a win for Black, or a draw. But after White moves first in chess, if Black has a double move followed by a double move of White and then alternating play,...

Barbanel, Brams, and Stromquist (2009) asked whether there exists a two-person moving-knife procedure that yields an envy-free, undominated, and equitable allocation of a pie. We present two procedures: One yields an envy-free, almost undominated, and almost equitable allocation, whereas the...