Anonymous yes–no voting with abstention and multiple levels of approval

Symmetric (3,2) simple games serve as models for anonymous voting systems in which each voter may vote “yes,” abstain, or vote “no,” the outcome is “yes” or “no,” and all voters play interchangeable roles. The extension to symmetric (j,2) simple games, in which each voter chooses from among j ordered levels of approval, also models some natural decision rules, such as pass–fail grading systems. Each such game is determined by the set of (anonymous) minimal winning profiles. This makes it possible to count the possible systems, and the counts suggest some interesting patterns. In the (3,2) case, the approach yields a version of May's Theorem, classifying all possible anonymous voting rules with abstention in terms of quota functions. In contrast to the situation for ordinary simple games these results reveal that the class of simple games with 3 or more levels of approval remains large and varied, even after the imposition of symmetry.     

Preferences, Property Rights, and Anonymity in Bargaining Games

Research on ultimatum and dictator games has found that because of "fairness" first movers in such games offer more than noncooperative game theory predicts. We find that if the right to be the first mover is "earned" by scoring high on a general knowledge quiz, then first movers behave in a more self-regarding manner. We also conducted dictator double blind experiments, in which the experimenter could not identify the decision maker. The results yielded by far our largest observed incidence of self-regarding offers, suggesting that offers are due to strategic and expectation considerations. Journal of Economic Literature Classification Numbers: C78, C91.     

The Core of Large Differentiable TU Games

For suitable non-atomic TU games ν, the core can be determined by computing appropriate derivatives of ν, yielding one of two stark conclusions: either core(ν) is empty or it consists of a single measure that can be expressed explicitly in terms of derivatives of ν. In this sense, core theory for a class of games may be reduced to calculus. Journal of Economic Literature Classification Number: C71.     

Infinite horizon common interest games with perfect information

We consider infinite horizon common interest games with perfect information. A game is a K-coordination game if each player can decrease other players' payoffs by at most K times his own cost of punishment. The number K represents the degree of commonality of payoffs among the players. The smaller K is, the more interest the players share. A K-coordination game tapers off if the greatest payoff variation conditional on the first t periods of an efficient history converges to 0 at a rate faster than K^−t as t→∞. We show that every subgame perfect equilibrium outcome is efficient in any tapering-off game with perfect information. Applications include asynchronously repeated games, repeated games of extensive form games, asymptotically finite horizon games, and asymptotically pure coordination games.     

Counting combinatorial choice rules

I count the number of combinatorial choice rules that satisfy certain properties: Kelso–Crawford substitutability, and independence of irrelevant alternatives. The results are important for two-sided matching theory, where agents are modeled by combinatorial choice rules with these properties. The rules are a small, and asymptotically vanishing, fraction of all choice rules. But they are still exponentially more than the preference relations over individual agents—which has positive implications for the Gale–Shapley algorithm of matching theory.     

The α-beauty contest: Choosing numbers, thinking intervals

We present a model for the α-beauty contest that explains common patterns in experimental data of one-shot and iterative games. The approach is based on two basic assumptions. First, players iteratively update their recent guesses. Second, players estimate intervals rather than exact numbers to cope with incomplete knowledge of other players' rationality. Under these assumptions we extend the cognitive hierarchy model of Camerer et al. [Camerer, C., Ho, T., Chong, J., 2003b. A cognitive hierarchy model of one-shot games. Quart. J. Econ. 119, 861–898]. The extended model is estimated on experimental data from a newspaper experiment.     

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.     

Testing theories of behavior for extensive-form two-player two-stage games

We examine choices in two-player extensive-form games that give subjects opportunities for individualistic as well as other-regarding behavior, and where each subject makes choices in a variety of games. Following an extensive search over models, where we estimate a single parameter vector for all the games rather than different parameter vectors for each game, we find that (1) the level-n model organizes the data well, (2) other-regarding behaviors in these games appear to consist primarily of egalitarian and utilitarian behaviors, and (3) there is no significant evidence for reciprocal behavior. Electronic Supplementary Material  The online version of this article () contains supplementary material, which is available to authorized users.     

The Statistical Mechanics of Best-Response Strategy Revision

This paper compares local and global strategic interaction when players update using the (myopic) best-response rule. I show that randomizing the order in which players update their strategic choice suffices to achieve coordination on the risk-dominant strategy in symmetric 2 × 2 coordination games. The "persistant randomness" which is necessary to achieve similar coordination with global interaction is replaced under local interaction by spatial variation in the initial condition. An extension of the risk-dominance idea gives the same convergence result for K × K games with strategic complementarities. Similar results for K × K pure coordination games and potential games are also presented. Journal of Economic Literature Classification Number: C78.     

An elephantine theory of depressions

In microeconomics a theory is thought to be, if not inadequate, then incomplete unless it can be interpreted as “telling a story.” Beavers and deers, perpetual plants, aging wine—these and other homely examples play a larger role in our assessment of the validity of theories than economists might want to admit. If we cannot find a plausible story, then the theory itself is often suspect. This criterion may be applied to macroeconomics too…     

Bounding the inefficiency of equilibria in nonatomic congestion games

Equilibria in noncooperative games are typically inefficient, as illustrated by the Prisoner's Dilemma. In this paper, we quantify this inefficiency by comparing the payoffs of equilibria to the payoffs of a “best possible” outcome. We study a nonatomic version of the congestion games defined by Rosenthal [Int. J. Game Theory 2 (1973) 65], and identify games in which equilibria are approximately optimal in the sense that no other outcome achieves a significantly larger total payoff to the players—games in which optimization by individuals approximately optimizes the social good, in spite of the lack of coordination between players. Our results extend previous work on traffic routing games.     

Non-Additive Beliefs and Strategic Equilibria

This paper studies n-player games where players' beliefs about their opponents' behaviour are modelled as non-additive probabilities. The concept of an “equilibrium under uncertainty” which is introduced in this paper extends the equilibrium notion of Dow and Werlang (1994, J. Econom. Theory64, 305–324) to n-player games in strategic form. Existence of such an equilibrium is demonstrated under usual conditions. For low degrees of ambiguity, equilibria under uncertainty approximate Nash equilibria. At the other extreme, with a low degree of confidence, maximin equilibria appear. Finally, robustness against a lack of confidence may be viewed as a refinement for Nash equilibria. Journal of Economic Literature Classification Numbers: C72, D81.     

Asymmetric evolutionary games with non-linear pure strategy payoffs

In this paper, I extend the analytical framework of evolutionary game theory to games with two distinct types of players where the type-specific payoff functions are nonlinear on the right—bi-player-type nonlinear (BNL) evolutionary games. That is, asymmetric games where the payoffs for pairwise interactions are influenced by the ambient frequencies of the pertinent strategies of both types of players.While this paper is motivated by my interest in inter- and intra-gender conflicts of interest in sexual reproduction, BNL games also arise just as naturally in most two-species interactions. Thus, the methodology may provide a novel approach to investigating such classical ecological phenomena as prey–predator/host–parasite interactions and interspecies competition for resources.Finally, given the growing tendency to utilize evolutionary games in economic modeling, a case can be made for the current paper being of interest to traditional game-theoretic modelers in connection with situations such as buyer/seller or employer/employee interaction.     

Repeated Games with Bounded Entropy

We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer's strategies while the other player is unrestricted. We will show that if the bound η(n), a function of the number of repetitions n, satisfies the condition η(n)/n → γ (n → ∞), then the maxmin value Wⁿ(η(n)) converges to (cav U)(γ), the concavification of the maxmin value of the stage game in which the maximizer's actions are restricted to those with entropy at most γ. A similar result is obtained for the infinitely repeated games. Journal of Economic Literature Classification Numbers: C73, C72.     

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.     

Remarks on the application of statistical games to technological development forecasting

This work presents the probability of determining a quantitative forecast of technological development S(t) defined by a set m of parameters S⁽¹⁾(t),S⁽²⁾(t),…,S^(m)(t), based on statistical game theory. Assuming that the coordinates S⁽ⁱ⁾(t) (i = 1, 2,…,m) of a forecasted vector S(t) are stochastic processes with given probabilistic characteristics, a formula of a function forecasting the value of a coordinate S⁽ⁱ⁾(t) of this vector can be obtained. This formula permits to determine a vector of forecasts _τT(x) of technological development S(t) at a given moment t = τ+T.     

The core of an m-sided assignment game

A generalization of Shapley-Shubik's (1972, Int. J. Game Theory, 1, 111–130) housing market in which there are m types of agents instead of two is considered. These games can have empty cores. A subclass of such games with nonempty cores is presented.     

A general structure theorem for the Nash equilibrium correspondence

I consider n-person normal form games where the strategy set of each player is a non-empty compact convex subset of an Euclidean space, and the payoff function of player i is continuous in joint strategies and continuously differentiable and concave in the player i's strategy. No further restrictions (such as multilinearity of the payoff functions or the requirement that the strategy sets be polyhedral) are imposed. I demonstrate that the graph of the Nash equilibrium correspondence on this domain is homeomorphic to the space of games. This result generalizes a well-known structure theorem in [Kohlberg, E., Mertens, J.-F., 1986. On the strategic stability of equilibria. Econometrica 54, 1003–1037]. It is supplemented by an extension analogous to the unknottedness theorems in [Demichelis S., Germano, F., 2000. Some consequences of the unknottedness of the Walras correspondence. J. Math. Econ. 34, 537–545; Demichelis S., Germano, F., 2002. On (un)knots and dynamics in games. Games Econ. Behav. 41, 46–60]: the graph of the Nash equilibrium correspondence is ambient isotopic to a trivial copy of the space of games.     

A model of noisy introspection

We present a theoretical model of noisy introspection designed to explain behavior in games played only once. The model determines layers of beliefs about others' beliefs about …, etc., but allows for surprises by relaxing the equilibrium requirement that belief distributions coincide with decision distributions. Noise is injected into iterated conjectures about others' decisions and beliefs, which causes the predictions to differ from those of deterministic models of iterated thinking, e.g., rationalizability. The paper contains a convergence proof that implies existence and uniqueness of the outcome of the iterated thought process. In addition, estimated introspection and noise parameters for data from 37 one-shot matrix games are reported. The accuracy of the model is compared with that of several alternatives.     

Evolutionary stability and lexicographic preferences

We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. Econ. Theory 57, 278–305) are limit Nash equilibria. Modified evolutionary stability differs from “lexicographic evolutionarily stability” (defined by extending the common characterization of evolutionary stability to lexicographic preferences) in the order in which limits in the payoff space and the space of invasion barriers are taken.