We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

We consider a class of perfect information bargaining games with unanimity acceptance rule. The proposer and the order of responding players are determined by the state that evolves stochastically over time. The probability distribution of the state in the next period is determined jointly by...

We consider a class of perfect information bargaining games with unanimity acceptance rule. The proposer and the order of responding players are determined by the state that evolves stochastically over time. The probability distribution of the state in the next period is determined jointly by...

We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

We study strategic negotiation models featuring costless delay, general recognition procedures, endogenous voting orders, and finite sets of alternatives. Two examples show: 1. non-existence of stationary subgame-perfect equilibrium (SSPE). 2. the recursive equations and optimality conditions...

We show that in the canonical non-cooperative multilateral bargaining game, a subgame perfect equilibrium exists in pure stationary strategies, even when the space of feasible payoffs is not convex. At such an equilibrium there is no delay. We also have the converse result that randomization...

We study the division of a surplus under majoritarian bargaining in the three-person case. In a stationary equilibrium as derived by Baron and Ferejohn (1989), the proposer offers one third times the discount factor of the surplus to a second player and allocates no payoff to the third player, a...

We study strategies with one–period recall in the context of a general class of multilateral bargaining games. A strategy has one–period recall if actions in a particular period are only conditioned on information in the previous and the current period. We show that if players are...

We analyze the simplest Condorcet cycle with three players and three alternatives within a strategic bargaining model with recognition probabilities and costless delay. Mixed consistent subgame perfect equilibria exist whenever the geometric mean of the agents' risk coefficients, ratios of...