The bargaining model with stochastic order of proposing players is properly embedded in continuous time and it is strategically equivalent to the alternating offers model. For all parameter values, the pair of equilibrium proposals corresponds to the Nash bargaining solution of a modified...

The Nash bargaining solution of a modified bargaining problem in the contract space yields the pair of stationary subgame perfect equilibrium proposals in the alternating offers model, also for positive time between proposals. As time vanishes, convergence to the Nash bargaining solution is...

We study a bargaining model with a disagreement game between offers and counteroffers. In order to characterize the set of its subgame perfect equilibrium payoffs, we provide a recursive technique that relies on the Pareto frontier of equilibrium payoffs. When players have different time...

In a recent paper, Muthoo (1995) discusses whether the Rubinstein solution carries over on repeated bargaining situations. He concludes that stationary equilibria for such a repeated bargaining game do not imply the Rubinstein solution and that several non-stationary equilibria may exist. This...

We study the steady state of a market with incoming cohorts of buyers and sellers who are matched pairwise and bargain under private information. We first consider generalized random-proposer take-it-or-leave-it offer games (GRP TIOLI games). This class of games includes a simple random-proposer...

We study equilibria of dynamic over-the-counter markets in which agents are distinguished by their preferences and information. Over time, agents are privately informed by bids and o ffers. Investors diff er with respect to information quality, including initial information precision, and also...

We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical...

We solve for the equilibrium dynamics of information sharing in a large population. Each agent is endowed with signals regarding the likely outcome of a random variable of common concern. Individuals choose the effort with which they search for others from whom they can gather additional...

Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...