The foundation of stability in extensive games with perfect information

This paper studies the decision-theoretic foundation for the notion of stability in the dynamic context of strategic interaction. We formulate and show that common knowledge of rationality implies a “stable” pattern of behavior in extensive games with perfect information. In the “generic” case, our approach is consistent with Aumann’s [Aumann, R.J., 1995. Backward induction and common knowledge of rationality. Games and Economic Behavior 8, 6–19] result that common knowledge of rationality leads to the backward induction outcome.     

Coalitional manipulations in a bankruptcy problem

In a bankruptcy problem framework we consider rules immune to possible manipulations by the creditors involved in the problem via merging or splitting of their individual claims. The paper provides characterization theorems for the non manipulable rules, the no advantageous merging parametric rules and the no advantageous splitting parametric rules. Received: 24 February 1998 / accepted: 9 March 1999     

Reduction-consistency in collective choice problems

We consider the problem of choosing a subset of a feasible set over which each agent has a strict preference. We propose an invariance property, reduction-consistency, of choice rules and study its implications. The property is a natural expression for the problems of a general principle of consistency having been studied extensively in resource allocation problems. We show that no scoring rule satisfies reduction-consistency, and base a characterization of the top rule on the property. We also investigate the minimal extension of a rule needed to recover reduction-consistency, and identify the minimal extensions of several rules including the Borda and plurality rules.     

Deriving Nash equilibria as the supercore for a relational system

In this paper, under a binary relation that refines the standard relation which only accounts for single profitable deviations, we obtain that the set of NE strategy profiles of every finite non-cooperative game in normal form coincides with the supercore (Roth, 1976) of its associated abstract system. Further, under the standard relation we show when these two solution concepts coincide.     

Are serial Condorcet rules strategy-proof?

Abstract. This paper explores the extent to which majority rule is invulnerable to manipulation by individuals and coalitions, even when majority rule is used to select more than one alternative. The resulting rule may or may not be strategy-proof, depending on the size of the coalitions that can form, and on the nature of the individual preferences over sets of alternatives. No individual can manipulate with respect to a wide family of preferences over sets. The only restriction on the domain of true and revealed individual preferences is that the selection rule is always well defined. Received: 1 November 1999 / Accepted: 7 May 2001 We thank two anonymous referees for suggestions that have significantly improved the paper. We are also grateful to l'Université de Caen for sponsoring a Workshop on Social Choice Theory, where a first draft of this paper was presented in May, 1999, and to the workshop participants for helpful observations. Work on the final version of the paper was done while one of the authors was a guest of the Project on Intergenerational Equity supported by the Ministry of Education, Science, and Technology of Japan. We are grateful to the Ministry and to the project leader, Professor Kotaro Suzumura, for their support.     

Strategy-proofness in many-to-one matching problems

We search forstrategy-proof solutions in the context of (many-to-one) matching problems (Gale and Shapley, 1962). In this model, whenever the firms can hire as many workers as they want (the capacities are unlimited) the stable set is a singleton. There exists aPareto efficient, individually rational, andstrategy-proof matching rule if and only if the capacities are unlimited. Furthermore, whenever the capacities unlimited, the matching rule which selects the unique stable matching is the only matching rule that isPareto efficient, individually rational, andstrategy-proof.     

On top responsiveness and strict core stability

Alcalde and Revilla [Journal of Mathematical Economics 40 (2004) 869–887] introduce a top responsiveness condition on players’ preferences in hedonic games and show that it guarantees the existence of a core stable partition. In the present note we strengthen this observation by proving that under top responsiveness even the strict core is non-empty.     

A social choice function implementable via backward induction with values in the ultimate uncovered set

We prove the existence of a social choice function implementable via backward induction which always selects within the ultimate uncovered set. Whereas the uncovered set is the set of maximal elements of the covering relation, the ultimate uncovered set is the set obtained by iterative application of this covering operation. Dutta and Sen (1993) showed that any social choice function which is the solution of a generalized binary voting procedure is implementable via backward induction. Our result follows from Dutta and Sen's theorem, in that we construct a binary voting procedure always selecting within the ultimate uncovered set. We use the classical multistage elimination procedure, which always selects an alternative within the uncovered set. When this procedure is also used to select among all of the possible agendas or orderings of alternatives within the procedure, the alternative selected (from the agenda selected) will be within the uncovered set of the uncovered set. Our result follows from repeated application of this construction. Intuitively, the procedure constructed consists of requiring agents to vote on how they should vote and so on. Received: 7 April 1997 / Accepted: 15 October 1998     

Inference in a synchronization game with social interactions

This paper studies inference in a continuous time game where an agent’s decision to quit an activity depends on the participation of other players. In equilibrium, similar actions can be explained not only by direct influences but also by correlated factors. Our model can be seen as a simultaneous duration model with multiple decision makers and interdependent durations. We study the problem of determining the existence and uniqueness of equilibrium stopping strategies in this setting. This paper provides results and conditions for the detection of these endogenous effects. First, we show that the presence of such effects is a necessary and sufficient condition for simultaneous exits. This allows us to set up a nonparametric test for the presence of such influences, which is robust to multiple equilibria. Second, we provide conditions under which parameters in the game are identified. Finally, we apply the model to data on desertion in the Union Army during the American Civil War, and find evidence of endogenous influences.     

Exchange-proofness or divorce-proofness? Stability in one-sided matching markets

Two stability concepts for one-sided matching markets are analyzed: Gale-Shapley stability and ξ-stability. The first one applies best to markets where no status quo allocation is considered, whereas the second one is a solution to be used when property rights are allowed. A common problem of existence is shared by both solution concepts. Hence, we study economic environments where this problem does not exist, and present a family of agents’ preferences for which existence is guaranteed for both Gale-Shapley stable and ξ-stable outcomes. This work was finished while the author was visiting Duke University, whose hospitality is gratefully acknowledged. Swveral discussions with Salvador Barberà, Hervé Moulin and Marilda Sotomayor and some advice by an anonymous referee were specially useful. This work is partially supported by Grants PB 92-0590 and PB 93-0938 from the DGICYT, the Spanish Ministery of Educación Ciencia, and the Institut Valencià d’Investigacions Econòmiques.     

Erratum to “Do pure indivisibilities prevent core equivalence? Core equivalence theorem in an atomless economy with purely indivisible commodities only” [J. Math. Econ. 41 (4–5) (2005) 571–601]

We consider a pure exchange economy with a continuum of agents and finitely many indivisible commodities. Every commodity can be consumed only in integer amounts. Thus, agents’ preferences are locally satiated and no commodity bundle has necessarily local cheaper points. We introduce a core which is an intermediate concept between the strong core and the weak core. In our economy, this core is the most natural concept in the sense that it coincides with the set of all exactly feasible Walras allocations.     

The Walras core of an economy and its limit theorem

The Walras core of an economy is the set of allocations that are attainable for the consumers when their trades are constrained to be based on some agreed price system, such that no alternative price system exists for any sub-coalition that allows all members to trade to something better. As compared with the Edgeworth core, both coalitional improvements and being a candidate allocation for the Walras core become harder. The Walras core may even contain allocations that violate the usual Pareto efficiency. Nevertheless, the competitive allocations are the same under the two theories, and the equal-treatment Walras core allocations converge under general conditions to the competitive allocations in the process of replication.     

Dynamics,stability, and foresight in the Shapley–Scarf housing market

While most of the literature starting with Shapley and Scarf (1974) have considered a static exchange economy with indivisibilities, this paper studies the dynamics of such an economy. We find that both the dynamics generated by competitive equilibrium and the one generated by the weak dominance relation, converge to a set of allocations we define as strictly stable, which we can show to exist. Moreover, we show that even when only pairwise exchanges between two traders are allowed, the strictly stable allocations are attained eventually if traders are sufficiently farsighted.     

Implementation of voting operators

We show that a theory of implementation can be developed in the Aizerman–Aleskerov framework, capturing the main ideas regarding Nash implementation in the Arrovian case. In fact we obtain the counterparts of the results of [Maskin, E., 1977. Nash Equilibrium and Welfare Optimality. MIT, Mimeo] and [Moore, J., Repullo, R., 1990. Nash implementation. A full characterization. Econometrica 58, 1038–1100] in the new framework.     

Theorems on the core of an economy with infinitely many commodities and consumers

It is known that the classical theorems of Grodal [Grodal, B., 1972. A second remark on the core of an atomless economy. Econometrica 40, 581–583] and Schmeidler [Schmeidler, D., 1972. A remark on the core of an atomless economy. Econometrica 40, 579–580] on the veto power of small coalitions in finite dimensional, atomless economies can be extended (with some minor modifications) to include the case of countably many commodities. This paper presents a further extension of these results to include the case of uncountably many commodities. We also extend Vind’s [Vind, K., 1972. A third remark on the core of an atomless economy. Econometrica 40, 585–586] classical theorem on the veto power of big coalitions in finite dimensional, atomless economies to include the case of an arbitrary number of commodities. In another result, we show that in the coalitional economy defined by an atomless individualistic model, core–Walras equivalence holds even if the commodity space is non-separable. The above-mentioned results are also valid for a differential information economy with a finite state space. We also extend Kannai’s [Kannai, Y., 1970. Continuity properties of the core of a market. Econometrica 38, 791–815] theorem on the continuity of the core of a finite dimensional, large economy to include the case of an arbitrary number of commodities. All of our results are applications of a lemma, that we prove here, about the set of aggregate alternatives available to a coalition. Throughout the paper, the commodity space is assumed to be an ordered Banach space which has an interior point in its positive cone.     

Extreme points of two digraph polytopes: Description and applications in economics and game theory

In this paper, we introduce two polytopes that respect a digraph in the sense that for every vector in the polytope every component corresponds to a node and is at least equal to the component corresponding to each successor of this node. The sharing polytope is the set of all elements from the unit simplex that respect the digraph. The fuzzy polytope is the set of all elements of the unit cube respecting the digraph. The main results are characterizations of the extreme points of the above described two digraph polytopes. We also give an economic application of the result on the sharing polytope and a game-theoretical application for the fuzzy polytope.     

Fairness and implementability in allocation of indivisible objects with monetary compensations

This paper introduces a general framework for the fair allocation of indivisible objects when each agent can consume at most one (e.g., houses, jobs, queuing positions) and monetary compensations are possible. This framework enables us to deal with identical objects and monotonicity of preferences in ranking objects. We show that the no-envy solution is the only solution satisfying equal treatment of equals, Maskin monotonicity, and a mild continuity property. The same axiomatization holds if the continuity property is replaced by a neutrality property.     

The Blocking Lemma for a many-to-one matching model

The Blocking Lemma identifies a particular blocking pair for each non-stable and individually rational matching that is preferred by some agents of one side of the market to their optimal stable matching. Its interest lies in the fact that it has been an instrumental result to prove key results on matching. For instance, the fact that in the college admissions problem the workers-optimal stable mechanism is group strategy-proof for the workers and the strong stability theorem in the marriage model follow directly from the Blocking Lemma. However, it is known that the Blocking Lemma and its consequences do not hold in the general many-to-one matching model in which firms have substitutable preference relations. We show that the Blocking Lemma holds for the many-to-one matching model in which firms’ preference relations are, in addition to substitutable, quota q-separable. We also show that the Blocking Lemma holds on a subset of substitutable preference profiles if and only if the workers-optimal stable mechanism is group strategy-proof for the workers on this subset of profiles.     

Intertemporal coordination in two-period markets

This paper studies the stability of the intertemporal coordination dynamics when the common knowledge of individual expectations of future prices is perturbed in a neighborhood of a perfect foresight equilibrium. The main forces that affect stability are: (i) the effect of a change in asset demand on second period spot market prices, and (ii) the effect on asset demand of a small change in second period prices. In an intertemporal market game whose interior Markov perfect equilibria correspond to perfect foresight equilibria, it is shown that though M-rationalizability implies the stability of the intertemporal dynamics, the converse is not always true.