We propose an elementary theory of wars fought by fully rational contenders that features three of the main rationalist explanations for armed conflicts: uncertainty, commitment, and indivisibility. Two parties play a Markov game that combines stages of bargaining, where offers are made, with...

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

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

This paper studies stationary Markov perfect equilibria in multidimensional models of dynamic bargaining, in which the alternative chosen in one period determines the status quo for the next. We generalize a sufficient condition for existence of equilibrium due to Anesi and Seidmann, 2015. We...

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

The Rubinstein and Wolinsky bargaining-in-markets framework is modified by the introduction of asymmetric information and non-stationarity. Non-stationarity is introduced in the form of an arbitrary stochastic Markov process which captures the dynamics of market entry and pairwise matching. A...

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 propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions...