Eliciting Preferences to Assign Positions and Compensation

We describe strategy-proof rules for economies where an agent is assigned a position (e.g., a job) plus some of a divisible good. For the 2-agent–2-position case we derive a robust characterization. For the multi-agent–position case, many “arbitrary” such rules exist, so we consider additional requirements. By also requiring coalitional strategy-proofness or nonbossiness, the range of a solution is restricted to the point that such rules are not more complex than those for the Shapley–Scarf housing model (no divisible good). Third, we show that essentially only constant solutions are immune to manipulations involving “bribes.” Finally, we demonstrate a conflict between efficiency and strategy-proofness. The results extend to models (without externalities) in which agents share positions. Journal of Economic Literature Classification Numbers: C72, D70.     

Subgame-perfect implementation of bargaining solutions

We study house allocation problems introduced by L. Shapley and H. Scarf (1974, J. Math. Econ.1, 23–28). We prove that a mechanism (a social choice function) is individually rational, anonymous, strategy-proof, and nonbossy (but not necessarily Pareto efficient) if and only if it is either the core mechanism or the no-trade mechanism, where the no-trade mechanism is the one that selects the initial allocation for each profile of preferences. This result confirms the intuition that even if we are willing to accept inefficiency, there exists no interesting strategy-proof mechanism other than the core mechanism. Journal of Economic Literature Classification Numbers: C71, C78, D71, D78, D89.     

Games of Manipulation in Marriage Problems

We analyze the “equilibrium” outcomes of thepreference revelation gamesinduced byPareto efficientandindividually rationalsolutions in the context ofmarriage problems. We employ a Nash equilibrium refinement which allows deviations by a set of permissible coalitions, and show that the set of equilibrium outcomes coincides with a variant of the core that allows blocking by only permissible coalitions,Journal of Economic LiteratureClassification Numbers: C71, C78, D71, D78.     

Subjective states: A more robust model

We study the demand for flexibility and what it reveals about subjective uncertainty. As in Kreps [D. Kreps, 1979. A representation theorem for ‘preference for flexibility’. Econometrica 47, 565–577], Nehring [K. Nehring, 1996. Preference for flexibility and freedom of choice in a Savage framework. UC Davis Working Paper; K. Nehring, 1999. Preference for flexibility in a Savage framework. Econometrica 67, 101–119] and Dekel et al. [E. Dekel, B. Lipman, A. Rustichini, 2001. Representing preferences with a unique subjective state space. Econometrica 69, 891–934], the latter is represented by a subjective state space consisting of possible future preferences over actions to be chosen ex post. One contribution is to provide axiomatic foundations for a range of alternative hypotheses about the nature of these ex post preferences. Secondly, we establish a sense in which the subjective state space is uniquely pinned down by the ex ante ranking of (random) menus. Finally, we demonstrate the tractability of our representation by showing that it can model the two comparative notions “2 desires more flexibility than 1” and “2 is more averse to flexibility-risk than is 1.”     

On the Existence of Stable Roommate Matchings

This paper identifies a condition called “no odd rings” that is sufficient for the existence of stable roommate matchings in the weak preferences case. It shows that the process of allowing randomly chosen blocking pairs to match converges to a stable roommate matching with probability one as long as there are no odd rings. This random-paths-to-stability result generalizes that of Roth and Vande Vate (1990, Econometrica58, 1475–1480) and may not hold if there are odd rings. The “no odd rings” condition can also be used to prove a number of other sufficient conditions that are more economically interpretable. Journal of Economic Literature Classification Numbers: C78, D71.     

Topological games at Princeton, a mathematical memoir

The games of the title are “Nash” (or Hex), “Milnor” (or Y), “Shapley” (or Projective Plane) and “Gale” (or Bridg-It) all of which were discovered (or re-discovered) in Princeton in 1948–1949. After giving the basic topological connections, I will discuss more recent ramifications related to computational complexity theory. A recurrent theme will be non-constructive proofs, or how we can know something can be done without having the slightest idea of how to do it.     

Distributive and Additive Costsharing of an Homogeneous Good

Individual users demand different quantities of a homogeneous good produced under variable returns. We describe the family of costsharing methods that allocate costs in proportion to demands when returns are constant, and commute with the additivity and composition of cost functions. Two simple such methods are average cost pricing and incremental costsharing. All other methods in the family combine elements of the average cost and incremental ones. Serial costsharing stands out prominently in the family, whereas the Shapley–Shubik method, and all values from the associated stand alone cooperative game, are excluded.Journal of Economic LiteratureClassification Numbers: D63, C71.     

Optimality and Robustness of the English Auction

In Milgrom and Weber's (1982, Econometrica50, 1089–1122) “general symmetric model,” under a few additional regularity conditions, the English auction maximizes the seller's expected profit within the class of all posterior-implementable trading procedures and fails to do so among all interim incentive-compatible procedures in which “losers do not pay.” These results suggest that appropriate notions of robustness and simplicity which imply the optimality of the English auction for a risk-neutral seller must impose “bargaining-like” features on the set of feasible trading mechanisms. Journal of Economic Literature Classification Numbers: D44, D82.     

Abreu–Matsushima Mechanisms: Experimental Evidence

Abreu–Matsushima mechanisms can be applied to a broad class of games to induce any desired outcome as the unique rationalizable outcome. We conduct experiments investigating the performance of such mechanisms in two simple coordination games. In these games one pure-strategy equilibrium is “focal”; we assess the efficacy of Abreu–Matsushima mechanisms for implementing the other pure-strategy equilibrium outcome. Abreu–Matsushima mechanisms induce some choices consistent with the desired outcome, but more choices reflect the focal outcome. Moreover, “strengthening” the mechanism has a perverse effect when the desired outcome is a Pareto-dominated risk-dominated equilibrium.Journal of Economic LiteratureClassification Number: C7.     

Cost Sharing under Increasing Returns: A Comparison of Simple Mechanisms

A technology with decreasing marginal costs is used by agents with equal rights. Each agent demands a quantity of output and costs are divided by means of a fixed formula. Several such mechanisms are compared for the existence of Nash equilibrium demand profiles and for the equity properties of these equilibria. Among three mechanisms, average cost pricing, the Shapley–Shubik cost sharing, and serial cost-sharing, only the latter two possess at least one Nash equilibrium on a reasonable domain of individual preferences. Only the serial cost sharing equilibria pass the equity tests of No Envy and Stand Alone cost.Journal of Economic LiteratureClassification Numbers: C72, D63.     

Stability and Largeness of the Core

In general, there are examples of TU games where the core is stable but is not large. In this paper, we show that the extendability condition introduced by Kikuta and Shapley (1986, “Core Stability in n-Person Games,” Mimeo) is sufficient for the core to be stable as well as large, for TU games with five or fewer players. We provide a counter example when the number of players is six. We then introduce a stronger extendability condition and show that it is necessary and sufficient for the core to be large. Our proof makes use of a well-known result from the theory of convex sets. Journal of Economic Literature Classification Number: C71.     

Player Types and Self-Impression Management in Dictatorship Games: Two Experiments

Recent experimental research on dictatorship games shows that many dictators share their outcomes with unknown, anonymous others. The data suggests that dictators can be “typed” as rational (taking the maximum), equal (splitting outcomes equally), or “other.” This paper experimentally tests the self-impression management model, which predicts that individuals act to show themselves in a positive light, even when they are the only observer of their own behavior. The model predicts that the “other” type of dictator will avoid being greedy by taking more only as their choices are increasingly restricted. Results from two experiments support the model's predictions. The conclusion advocates differentiating basic psychological motivations in modeling individual behavior. Journal of Economic Literature Classification Numbers: C78, C91, D63.     

Quasi-weightings, Trading, and Desirability Relations in Simple Games

We investigate the problem of simultaneously characterizing various classes of simple games in three different ways: (i) the existence of “quasi-weightings” in which smaller numerical values are assigned to losing coalitions than are assigned to winning ones, (ii) the robustness of “winningness” with respect to trades involving groups of players, and (iii) the acyclicity of certain strict “orderings” that intuitively correspond to the idea of one player being more desirable than another.Journal of Economic LiteratureClassification Number: C71.     

The Role of Absolute Continuity in “Merging of Opinions” and “Rational Learning”

D. Blackwell and L. Dubins (1962, Ann. Math. Statist.38, 882–886) showed that opinions merge when priors are absolutely continuous. E. Kalai and E. Lehrer (1993, Econometrica61, 1019–1045) use this result to show that players in a repeated game eventually play like a Nash equilibrium. We provide an alternative proof of merging of opinions that clarifies the role of absolute continuity while casting doubt on the relevance of the result. Persistent disagreement, the opposite of merging, allows the construction of a sequence of mutually favorable “bets.” By a law of large numbers, both agents are certain they will win these bets on average. This certain disagreement violates absolute continuity. Journal of Economic Literature Classification Numbers: C11, C69, C72, D83.     

Benefit and Distance Functions

We explore the relationship between R. W. Shephard's input distance function (“Cost and Production Functions,” Princeton Univ. Press, Princeton, 1953) and D. G. Luenberger's benefit function (J. Math. Econ.21(1992a), 461–481). We point out that the latter can be recognized in a production context as a directional input distance function which can exhaustively characterize technologies in both price and input space. D. McFadden's (Cost, revenue, and profit functions,in“Production Economics: A Dual Approach to Theory and Applications, “North-Holland/Elsevier, New York, 1978) composition rules for input sets and input distance functions are then extended to the directional input distance function.Journal of Economic LiteratureClassification Numbers : D21, D24, D29.     

The communication cost of selfishness

We consider how many bits need to be exchanged to implement a given decision rule when the mechanism must be ex post or Bayesian incentive compatible. For ex post incentive compatibility, the communication protocol must reveal enough information to calculate monetary transfers to the agents to motivate them to be truthful (agents' payoffs are assumed to be quasilinear in such transfers). For Bayesian incentive compatibility, the protocol may need to hide some information from the agents to prevent deviations contingent on the information. In both settings with selfish agents, the communication cost can be higher than in the case in which the agents are honest and can be relied upon to report truthfully. The increase is the “communication cost of selfishness.” We provide an exponential upper bound on the increase. We show that the bound is tight in the Bayesian setting, but we do not know this in the ex post setting. We describe some cases where the communication cost of selfishness proves to be very low.     

Stochastic convergence of per capita carbon dioxide emissions and multiple structural breaks in OECD countries

This research applies an innovative panel data stationarity testing procedure developed by Carrion-i-Silvestre et al. [Carrion-i-Silvestre, J.L., Barrio-Castro, T.D. and Lopez-Bazo, E., 2005. Breaking the panels: An application to the GDP per capita, Econometrics Journal 8, 159–175.], which has the advantage of recognizing multiple structural breaks and the presence of cross-section dependence in order to re-investigate the hypothesis that per capita carbon dioxide (CO₂) emissions stochastically converge for 21 OECD countries from 1950 to 2002. Remarkably, the evidence clearly indicates that the panel dataset of relative per capita CO₂ emissions is stationary after the structural breaks and cross-sectional dependence are introduced into the model. These findings offer strong policy implications for governments, regardless of whether they are in “convergent group” or “divergent group” countries. We also find that the structural breaks in the 1960s and over the 1970–1982 period are associated with time periods of fossil fuel becoming the main source of productivity, higher oil prices, and the development of nuclear power.     

Truthful mechanism design for multidimensional scheduling via cycle monotonicity

We consider the makespan-minimization problem on unrelated machines in the context of algorithmic mechanism design. No truthful mechanisms with non-trivial approximation guarantees are known for this multidimensional domain. We study a well-motivated special case (also a multidimensional domain), where the processing time of a job on each machine is either “low” or “high.” We give a general technique to convert any c-approximation algorithm (in a black-box fashion) to a 3c-approximation truthful-in-expectation mechanism. Our construction uses fractional truthful mechanisms as a building block, and builds upon a technique of Lavi and Swamy [Lavi, R., Swamy, C., 2005. Truthful and near-optimal mechanism design via linear programming. In: Proc. 46th FOCS, pp. 595–604]. When all jobs have identical low and high values, we devise a deterministic 2-approximation truthful mechanism. The chief novelty of our results is that we do not utilize explicit price definitions to prove truthfulness. Instead we design algorithms that satisfy cycle monotonicity [Rochet, J., 1987. A necessary and sufficient condition for rationalizability in a quasilinear context. J. Math. Econ. 16, 191–200], a necessary and sufficient condition for truthfulness in multidimensional settings; this is the first work that leverages this characterization.     

Private Value Allocations in Large Economies with Differential Information

We consider a Radner-type (e.g., Radner, 1968, Econometrica36, 31–58) pure exchange economy with differential information and a continuum of agents. We show that under appropriate assumptions the set of Aumann–Shapley private value allocations in such an economy coincides with the set of Radner competitive equilibrium allocations. Journal of Economic Literature Classification Numbers: C71, D51, D82.