We propose three mechanisms to reach a compromise between two opposite parties that must choose one out of a set of candidates and operate under full information. All three mechanisms weakly implement the Unanimity Compromise Set. They all rely on the use of some Rule of k Names, whereby one of...

This paper offers a noncooperative behaviourally-founded solution of the complete information bargaining problem where two impatient individuals wish to divide a unit pie. We formulate the game in continuous time, with unrestricted timing and content of offers. Reprising experimental work from...

A two-person infinite-horizon bargaining model where one of the players may have either of two discount factors, has a multiplicity of perfect Bayesian equilibria. Introducing the slightest possibility that either player may be one of a rich variety of stationary behavioral types singles out a...

A two-person infinite-horizon bargaining model where one of the players may have either of two discount factors, has a multiplicity of perfect Bayesian equilibria. Introducing the slightest possibility that either player may be one of a rich variety of stationary behavioral types singles out a...