No profitable decompositions in quasi-linear allocation problems

We study the problem of allocating a bundle of perfectly divisible private goods from an axiomatic point of view, in situations where compensations can be made through monetary transfers. The key property we impose on the allocation rule requires that no agent should be able to gain by decomposing the problem into sequences of subproblems. Combined with additional standard properties, it leads to a characterization of the rule that shares the total surplus equally. Hence a traditional welfarist rule emerges as the unique consequence of our axioms phrased in a natural economic environment.     

Randomly available outside options in bargaining

We consider an extension of the standard Rubinstein model where both players are randomly allowed to leave the negotiation after a rejection, in which case they obtain a payoff of known value. We show that, when the value of the outside opportunities is of intermediate size, there exist a continuum of subgame-perfect equilibrium outcomes, including some with delayed agreements. Considering outside opportunities of significant value, we prove that efficient delays arise caused by the bargainers' aspirations, in waiting for their outside, option rather than by threats. Moreover, if taking the outside option decreases the probability that the opponent receives an outside option in the future, then it is possible that exactly two equilibrium payoffs coexist. In this latter case, inefficiencies may be created by agreeing too early.     

Strategic bargaining in the variable threat game

Summary. In this paper the alternating offer model with an exogenous risk of breakdown is taken to explicitly model the bargaining process underlying the variable threat game (Nash, Econometrica, 1953). A modified version of the variable threat game without commitment is also analysed within a dynamic context. The limit set of subgame perfect equilibria is characterized in both dynamic versions. The analysis gives rise to different results than in the two standard models. By making additional assumptions the original results can be regained, indicating that these are implicitly present in the standard analysis.Received: August 29, 1995; revised version: November 11, 1996This revised version was published online in February 2005 with corrections to the cover date.     

On two competing mechanisms for priority-based allocation problems

We consider the priority-based allocation problem: there is a set of indivisible objects with multiple supplies (e.g., schools with seats) and a set of agents (e.g., students) with priorities over objects (e.g., proximity of residence area). We study two well-known and competing mechanisms. The agent-optimal stable mechanism (AOSM) allots objects via the deferred acceptance algorithm. The top trading cycles mechanism (TTCM) allots objects via Gale's top trading cycles algorithm. We show that the two mechanisms are equivalent, or TTCM is fair (i.e., respects agents’ priorities), or resource monotonic, or population monotonic, if and only if the priority structure is acyclic. Furthermore, if AOSM fails to be efficient (consistent) for a problem, TTCM also fails to be fair (consistent) for it. However, the converse is not necessarily true.     

Uniqueness of stationary equilibria in bargaining one-dimensional policies under (super) majority rules

We consider negotiations selecting one-dimensional policies. Individuals have instantaneous preferences represented by continuous, concave and single-peaked utility functions, and they are impatient. Decisions arise from a bargaining game with random proposers and (super) majority approval, ranging from the simple majority up to unanimity. We provide sufficient conditions that guarantee the existence of a unique stationary subgame perfect equilibrium, and we provide its explicit characterization. The uniqueness of the equilibrium permits an analysis of the set of Pareto optimal voting rules. For symmetric distributions of peaks and uniform recognition probabilities unanimity is the unanimously preferred majority rule.     

Rubinstein bargaining with two-sided outside options

Summary. In this note we show that if in the standard Rubinstein model both players are allowed to leave the negotiation after a rejection, in which case they obtain a payoff of zero, then there exist a continuum of subgame-perfect equilibrium outcomes, including some which involve significant delay. We also fully characterize the case in which, upon quitting, the players can take an outside option of positive value. Received: February 27, 1996; revised version: March 28, 1997     

Efficient delays in a stochastic model of bargaining

Summary. We consider a k-player sequential bargaining model in which both the cake size and the identity of the proposer are determined by a stochastic process. For the case where the cake is a simplex (of random size) and the players share a common discount factor, we establish the existence of a unique stationary subgame perfect payoff which is efficient and characterize the conditions under which agreement is delayed. We also investigate how the equilibrium payoffs depend on the order in which the players move and on the correlation between the identity of the proposer and the cake size.Received: November 5, 1996; revised version: December 31, 1996This revised version was published online in February 2005 with corrections to the cover date.     

Matching and bargaining models of markets: approximating small markets by large markets

Summary. We show that the equilibrium of a matching and bargaining model of a market in which there is a finite number of agents at each date need not be near the equilibrium of a market with a continuum of agents, although matching probabilities are the same in both markets. Holding the matching process fixed, as the finite market becomes large its equilibrium approaches the equilibrium of its continuum limit.Received: January 22, 1996; revised version: September 24, 1996This revised version was published online in February 2005 with corrections to the cover date.     

Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms

There is a wide range of economic problems that involve the exchange of indivisible goods with no monetary transfers, starting from the housing market model of the seminal paper by Shapley and Scarf (1974) to problems such as the kidney exchange or the school choice problem. The classical solution to many of these models is to apply a mechanism called Top Trading Cycles, attributed to David Gale, which satisfies good properties for the case of strict preferences. In this paper, we propose a family of mechanisms, called Top Trading Absorbing Sets mechanisms, which generalize the Top Trading Cycles to the general case in which individuals are allowed to report indifferences, while preserving a maximal possible set of its desirable properties.     

How noise matters

Recent advances in evolutionary game theory have introduced noise into decisionmaking to select in favor of certain equilibria in coordination games. Noisy decisionmaking is justified on bounded rationality grounds, and consequently the sources of noise are left unmodelled. This methodological approach can only be successful if the results do not depend too much on the nature of the noise process. This paper investigates invariance to noise of these results, both for the random matching paradigm that has characterized much of the recent literature and for a larger class of two-strategy population games where payoffs may vary non-linearly with the distribution of strategies among the population. Several parametrizations of noise reduction are investigated. The results show that a symmetry property of the noise process and, in the case of non-linear payoffs, bounds on the asymmetry of the payoff functions suffice to preserve the known stochastic stability results.     

The ratchet effect and bargaining power in a two-stage model of competitive bidding

Summary. In the model presented, a buyer uses competitive bidding to facilitate her purchase of a good (the primary good of the exchange). Not included in the original purchase is the possible procurement of a good related to the original purchase: the supplementary good. The primary and supplementary goods are closely related; knowing a bidder's cost of producing the primary good implies that the buyer can infer the bidder's cost of producing the supplementary good. I show that a bidding mechanism for the primary good will fail to ensure an efficient allocation if the buyer learns the bid of the winner and the price of the supplementary good is determined through sequential bargaining. Received: August 22, 1996; revised version: June 23, 1997     

Coalitional bargaining games with random proposers: Theory and application

We consider a non-cooperative coalitional bargaining game with random proposers in a general situation for which players differ in recognition probability and time preference. We characterize an efficient equilibrium as the generalized Nash bargaining solution that belongs to the core. The model is applied to wage bargaining between an employer and multiple workers. Although involuntary unemployment may occur in equilibrium, full employment emerges as players become sufficiently patient.     

Non-cooperative solutions for estate division problems

In an estate division problem an estate has to be divided among several players whose total entitlement to the estate exceeds its size. This paper extends the non-cooperative approach through a claim game, as initiated by O?Neill (1982), by allowing players to put multiple claims on the same part of the estate, and by considering the case where individual entitlements may exceed the estate. A full characterization of the set of Nash equilibria of the claim game is obtained both for restricted estate division problems, where individual entitlements do not exceed the estate, and for the general case. Variations on the claim game are considered, which result in proportional division in equilibrium.     

A new axiomatization of the Banzhaf semivalue

A new characterization of the Banzhaf semivalue on the domain of monotonic simple games is given. We use the well-known valuation and dummy axioms plus two additional properties. The first one simply requires that the power-index be bigger for those players belonging to more winning coalitions. The second one is the proportionality axiom introduced by Owen in (1982) which is suitable for those simple games that represent an indirect voting process.     

On winning forecasting competitions in economics

To explain which methods might win forecasting competitions on economic time series, we consider forecasting in an evolving economy subject to structural breaks, using mis-specified, data-based models. ‘Causal’ models need not win when facing deterministic shifts, a primary factor underlying systematic forecast failure. We derive conditional forecast biases and unconditional (asymptotic) variances to show that when the forecast evaluation sample includes sub-periods following breaks, non-causal models will outperform at short horizons. This suggests using techniques which avoid systematic forecasting errors, including improved intercept corrections. An application to a small monetary model of the UK illustrates the theory.     

Commitment and choice of partner in a negotiation with a deadline

This paper analyses the effects of partially revocable endogenous commitments of a seller in a negotiation with a deadline. In particular, we examine when commitment is a source of strength, a source of inefficiency and when it does not affect the bargaining outcome at all. We show that when commitment possesses a minimum amount of irrevocability this crucially determines the bargaining outcome. In the bilateral bargaining case, commitment becomes a source of inefficiency since it causes a deadline effect. In the choice of partner framework, however, the deadline effect disappears and there is an immediate agreement and, moreover, commitment becomes a source of strength since it increases the seller's equilibrium payoff by triggering off competition between the buyers.     

Revealed group preferences on non-convex choice problems

Summary. This paper studies the conditions under which the basic results of the revealed preference theory can be established on the domain of choice problems which include non-convex feasible sets; the exercise is closely related to the works of Peters and Wakker (1991) and Bossert (1994). We show that while no continuous choice function can satisfy strong Pareto optimality over the class of all compact and comprehensive choice problems, strong Pareto optimality, Arrow's choice axiom, upper hemicontinuity and a weak compromisation postulate turn out to be necessary and sufficient to represent choice correspondences by continuous, strictly increasing and quasiconcave real-valued functions. Some applications of our main findings to axiomatic bargaining theory are also studied. Received: December 2, 1996; revised version: February 27, 1998     

Testing nonlinearity: Decision rules for selecting between logistic and exponential STAR models

A new LM specification procedure to choose between Logistic and Exponential Smooth Transition Autoregressive (STAR) models is introduced. The new decision rule has better properties than those previously available in the literature when the model is ESTAR and similar properties when the model is LSTAR. A simple natural extension of the usual LM-test for linearity is introduced and evaluated in terms of power. Monte-Carlo simulations and empirical evidence are provided in support of our claims.     

Monotonic and implementable solutions in generalized matching problems

We consider one-to-one matching problems when preferences are weak orders and search for (Maskin-)monotonic and implementable solutions. We show that for any coalition structure , the strong -core is monotonic if and only if it is the individually rational solution. We introduce a solution, which we call the “union strong -core”, and show that this solution is the minimal way to expand the strong -core recovering monotonicity. We also show that the union strong -core is implementable.     

Multilateral institutions for international economic policy coordination: bargaining vs voting

We study a world economy where worldwide policy coordination is essential to optimally stabilize unfavorable common supply shocks. We develop a two-stage game to investigate how to implement the first-best response to these shocks via a multilateral institution, whose board of directors is composed of a representative per each member country. In a first stage, national governments nominate their representatives on the board. In a second stage, the board collectively chooses stabilization policies. We compare the relative merits of two collective choice mechanisms – bargaining and majority voting – in avoiding manipulation of the cooperative agreement through the strategic nomination of national representatives.