On the (in)compatibility of rationality, monotonicity and consistency for cooperative games

On the domain of cooperative transferable utility games, we investigate if there are single valued solutions that reconcile rationality, consistency and monotonicity (with respect to the worth of the grand coalition) properties. This paper collects some impossibility results on the combination of core selection with either complement or projected consistency, and core selection, max consistency and monotonicity. By contrast, possibility results show up when combining individual rationality, projected consistency and monotonicity.

Manipulation via endowments in exchange markets with indivisible goods

We consider exchange markets with heterogeneous indivisible goods. We are interested in exchange rules that are efficient and immune to manipulations via endowments (either with respect to hiding or destroying part of the endowment or transferring part of the endowment to another trader). We consider three manipulability axioms: hiding-proofness, destruction-proofness, and transfer-proofness. We prove that no rule satisfying efficiency and hiding-proofness (which implies individual rationality) exists. For two-agent exchange markets with separable and responsive preferences, we show that efficient, individually rational, and destruction-proof rules exist. However, for separable preferences, no rule satisfies efficiency, individual rationality, and destruction-proofness. In the case of transfer-proofness the compatibility with efficiency and individual rationality for the two-agent case extends to the unrestricted domain. For exchange markets with separable preferences and more than two agents no rule satisfies efficiency, individual rationality, and transfer-proofness.

Efficient Nash Equilibrium under Adverse Selection

This paper revisits the problem of adverse selection in the insurance market of Rothschild and Stiglitz [28]. We propose a simple extension of the game-theoretic structure in Hellwig [14] under which Nash-type strategic interaction between the informed customers and the uninformed firms results always in a particular separating equilibrium. The equilibrium allocation is unique and Pareto-efficient in the interim sense subject to incentive-compatibility and individual rationality. In fact, it is the unique neutral optimum in the sense of Myerson [22].

Choice by sequential procedures

We propose a rule of decision-making, the sequential procedure guided byroutes, and show that three influential boundedly rational choice models can be equivalentlyunderstood as special cases of this rule. In addition, the sequential procedure guidedby routes is instrumental in showing that the three models are intimately related. We showthat choice with a status-quo bias is a refinement of rationalizability by game trees, which, inturn, is also a refinement of sequential rationalizability. Thus, we provide a sharp taxonomyof these choice models, and show that they all can be understood as choice by sequentialprocedures.

Consistent solutions in exchange economies: A characterization of the price mechanism

We characterize the Walrasian allocations correspondence by means offour axioms: consistency, replica invariance, individual rationality andPareto optimality. It is shown that for any given class of exchange economiesany solution that satisfies the axioms is a selection from the Walrasianallocations with slack. Preferences are assumed to be smooth, but may besatiated and non--convex. A class of economies is defined as all economieswhose agents' preferences belong to an arbitrary family (finite or infinite)of types. The result can be modified to characterize equal budget Walrasianallocations with slack by replacing individual rationality with individualrationality from equal division. The results are valid also for classes ofeconomies in which core--Walras equivalence does not hold.

A characterization of sequential rationalizability

A choice function is sequentially rationalizable if there is an ordered collection of asymmetric binary relations that identifies the selected alternative in every choice problem. We propose a property, F-consistency, and show that it characterizes the notion of sequential rationalizability. F-consistency is a testable property that highlights the behavioral aspects implicit in sequentially rationalizable choice. Further, our characterization result provides a novel tool with which to study how other behavioral concepts are related to sequential rationalizability, and establish a priori unexpected implications. In particular, we show that the concept of rationalizability by game trees, which, in principle, had little to do with sequential rationalizability, is a refinement of the latter. Every choice function that is rationalizable by a game tree is also sequentially rationalizable. Finally, we show that some prominent voting mechanisms are also sequentially rationalizable.

Endogenous bargaining power

We present a novel approach to N-person bargaining, based on the idea thatthe agreement reached in a negotiation is determined by how the directconflict resulting from disagreement would be resolved. Our basic buildingblock is the disagreement function, which maps each set of feasible outcomesinto a disagreement point. Using this function and a weak axiom basedon individual rationality we reach a unique solution: the agreement inthe shadow of conflict, ASC. This agreement may be construed as the limitof a sequence of partial agreements, each of which is reached as a functionof the parties relative power. We examine the connection between ASC andasymmetric Nash solutions. We show the connection between the power ofthe parties embodied in the ASC solution and the bias in the SWF thatwould select ASC as an asymmetric Nash solution.

A theory of reference-dependent behavior

Extensive field and experimental evidence in a variety of environments show that behavior depends on a reference point. This paper provides an axiomatic characterization of this dependence. We proceed by imposing gradually more structure on both choice correspondences and preference relations, requiring increasingly higher levels of rationality, and freeing the decision-maker from certain types of inconsistencies. The appropriate degree of behavioral structure will depend on the phenomenon that is to be modeled. Lastly, we provide two applications of our work: one to model the status-quo bias, and another to model addictive behavior.

Aggregate monotonic stable single-valued solutions for cooperative games

[cat] En aquest treball caracteritzem les solucions puntuals de jocs cooperatius d'utilitat transferible que compleixen selecció del core i monotonia agregada. També mostrem que aquestes dues propietats són compatibles amb la individualitat racional, la propietat del jugador fals i la propietat de simetria. Finalment, caracteritzem les solucions puntuals que compleixen les cinc propietats a l'hora.

Aggregate monotonic stable single-valued solutions for cooperative games

[cat] En aquest treball caracteritzem les solucions puntuals de jocs cooperatius d'utilitat transferible que compleixen selecció del core i monotonia agregada. També mostrem que aquestes dues propietats són compatibles amb la individualitat racional, la propietat del jugador fals i la propietat de simetria. Finalment, caracteritzem les solucions puntuals que compleixen les cinc propietats a l'hora.

Non-Deteriorating Choice

We analyze an alternative to the standard rationalizability requirement for observed choices by considering non-deteriorating selections. A selection function is a generalization of a choice function where selected alternatives may depend on a reference (or status quo) alternative in addition to the set of feasible options. A selection function is non-deteriorating if there exists an ordering over the universal set of alternatives such that the selected alternatives are at least as good as the reference option. We characterize non-deteriorating selection functions in an abstract framework and in an economic environment.

Non-Deteriorating Choice without Full Transitivity

Although the theory of greatest-element rationalizability and maximal-element rationalizability under general domains and without full transitivity of rationalizing relations is well-developed in the literature, these standard notions of rational choice are often considered to be too demanding. An alternative definition of rationality of choice is that of non-deteriorating choice, which requires that the chosen alternatives must be judged at least as good as a reference alternative. In game theory, this definition is well-known under the name of individual rationality when the reference alternative is construed to be the status quo. This alternative form of rationality of individual and social choice is characterized in this paper on general domains and without full transitivity of rationalizing relations.

Allocation via Deferred-Acceptance under Responsive Priorities

In many economic environments - such as college admissions, student placements at public schools, and university housing allocation - indivisible objects with capacity constraints are assigned to a set of agents when each agent receives at most one object and monetary compensations are not allowed. In these important applications the agent-proposing deferred-acceptance algorithm with responsive priorities (called responsive DA-rule) performs well and economists have successfully implemented responsive DA-rules or slight variants thereof. First, for house allocation problems we characterize the class of responsive DA-rules by a set of basic and intuitive properties, namely, unavailable type invariance, individual rationality, weak non-wastefulness, resource-monotonicity, truncation invariance, and strategy-proofness. We extend this characterization to the full class of allocation problems with capacity constraints by replacing resource- monotonicity with two-agent consistent con ict resolution. An alternative characterization of responsive DA-rules is obtained using unassigned objects invariance, individual rationality, weak non-wastefulness, weak consistency, and strategy-proofness. Various characterizations of the class of "acyclic" responsive DA-rules are obtained by using the properties efficiency, group strategy-proofness, and consistency.

Top trading with fixed tie-breaking in markets with indivisible goods

We study markets with indivisible goods where monetary compensations are not possible. Each individual is endowed with an object and a preference relation over all objects. When preferences are strict, Gale's top trading cycle algorithm finds the unique core allocation. When preferences are not necessarily strict, we use an exogenous profile of tie-breakers to resolve any ties in individuals' preferences and apply Gale's top trading cycle algorithm for the resulting profile of strict preferences. We provide a foundation of these simple extensions of Gale's top trading cycle algorithm from strict preferences to weak preferences. We show that Gale's top trading cycle algorithm with fixed tie-breaking is characterized by individual rationality, strategy-proofness, weak efficiency, non-bossiness, and consistency. Our result supports the common practice in applications to break ties in weak preferences using some fixed exogenous criteria and then to use a 'good and simple' rule for the resulting strict preferences. This reinforces the market-based approach even in the presence of indifferences because always competitive allocations are chosen.

House allocation via deferred-acceptance

We study the simple model of assigning indivisible and heterogenous objects (e.g., houses, jobs, offi ces, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. For this model, known as the house allocation model, we characterize the class of rules satisfying unavailable object invariance, individual rationality, weak non-wastefulness, resource-monotonicity, truncation invariance, and strategy-proofness: any rule with these properties must allocate objects based on (implicitly induced) objects' priorities over agents and the agent-proposing deferred-acceptance-algorithm.