We study the problem of dissolving an equal-entitlement partnership when the objective is to minimize maximum regret. We initially focus on the family of linear-pricing mechanisms and derive regret-optimizing strategies. We also demonstrate that there exist linear-pricing mechanisms satisfying...

Concessions try to avoid conflict in bargaining and can finally lead to an agreement. Although they usually are seen as unfolding in time, concessions can also be studied in normal form or by conditioning only on failure of earlier agreement attempts. We experimentally compare three protocols of...

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

To commit credibly in bargaining is crucial: In the ultimatum game with its one-sided early commitment power the “proposer” gets (nearly) the whole pie while the “responder” is left with (almost) nothing. When both parties commit simultaneously the (a)symmetric Nash(1950)-bargaining...

We investigate experimentally whether entry costs have an impact on the evolution of cooperation in a social dilemma game. In particular, subjects repeatedly play the so-called takeover game with anonymous partners randomly drawn from a fixed population of participants. The game represents a...