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

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

Lignite price negotiation between opencast mine and power plant as a two-stage, two-person, cooperative, non-zero sum game. Based on the simple model of the lignite deposit the methodology of finding the optimal solution for bilateral monopoly (BM) of lignite mine and power plant is shown taking...

Based on the simple model of the deposit the methodology of finding the optimal solution for bilateral monopoly (BM) of lignite mine and power plant is shown taking into account pit optimisation. It is proposed to treat lignite price negotiation as a kind of game. In the first stage...

In the recent literature on conflict resolution tends to underline negotiation model based on the argument or dialogue. Exchange between different styles of argument some trends have emerged in the rhetoric applied to the law, especially in procedural law. During the last decade researchers have...

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

We analyze a simple sequential algorithm (SA) for allocating indivisible items that are strictly ranked by n ≥ 2 players. It yields at least one Pareto-optimal allocation which, when n = 2, is envy-free unless no envy-free allocation exists. However, an SA allocation may not be maximin or...