Assume it is known that one player in a 2 x 2 game can detect the strategy choice of its opponent with some probability before play commences. We formulate conditions under which the detector can, by credibly committing to a strategy of probabilistic tit-for-tat (based on its imperfect...

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

We apply a fallback model of coalition formation to decisions of the U.S. Supreme Court, focusing on the seven natural courts, which had the same members for at least two terms, between 1969 and 2009. The predictions of majority coalitions on each of the courts are generally bourn out by the 5-4...

An allocation of indivisible items among n ≥ 2 players is proportional if and only if each player receives a proportional subset—one that it thinks is worth at least 1/n of the total value of all the items. We show that a proportional allocation exists if and only if there is an allocation...

We describe a simple 2-stage mechanism that induces two bargainers to be truthful in reporting their reservation prices in a 1st stage. If these prices criss-cross, the referee reports that they overlap, and the bargainers proceed to make offers in a 2nd stage. The average of the 2nd-stage...

We study the problem of dissolving a partnership when agents have unequal endowments. Agents bid on the price of the entire partnership. The highest bidder is awarded the partnership and buys out her partners' shares at a per-unit price that is a function of the two highest bids. We show that...