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.     

Learning from private information in noisy repeated games

We study the perfect type-contingently public ex-post equilibrium (PTXE) of repeated games where players observe imperfect public signals of the actions played, and both the payoff functions and the map from actions to signal distributions depend on an unknown state. The PTXE payoffs when players are patient are determined by the solutions to a family of linear programming problems. Using this characterization, we develop conditions under which play can be as if the players have learned the state. We provide a sufficient condition for the folk theorem, and a characterization of the PTXE payoffs in games with a known monitoring structure.     

Strategic network formation through peering and service agreements

We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomous Systems, enterprise networks, residential customers). In our model we are given a network topology of nodes and links where the nodes act as the players of the game, and links represent potential contracts. Nodes wish to satisfy their demands, which earn potential revenues, but may have to pay their neighbors for links incident to them. We incorporate some of the qualities of Internet business relationships, including customer–provider and peering contracts. We show that every Nash equilibrium can be represented by a circulation flow of utility with certain constraints. This allows us to prove bounds on the prices of anarchy and stability. We also focus on the quality of equilibria achievable through centralized incentives.     

On the folk theorem with one-dimensional payoffs and different discount factors

Proving the folk theorem in a game with three or more players usually requires imposing restrictions on the dimensionality of the stage-game payoffs. Fudenberg and Maskin (1986) assume full dimensionality of payoffs, while Abreu et al. (1994) assume the weaker NEU condition (“nonequivalent utilities”). In this note, we consider a class of n-player games where each player receives the same stage-game payoff, either zero or one. The stage-game payoffs therefore constitute a one-dimensional set, violating NEU. We show that if all players have different discount factors, then for discount factors sufficiently close to one, any strictly individually rational payoff profile can be obtained as the outcome of a subgame-perfect equilibrium with public correlation.     

An implementation of the Owen value

We present an implementation of the Owen value (Owen, 1977, Essays in Mathematical Economics and Game Theory, pp. 76–88), inspired by the bidding mechanism introduced by Pérez-Castrillo and Wettstein (2001, J. Econ. Theory 100, 274–294). The idea is the following: first players of each coalition play the bidding mechanism trying to obtain the resources of the coalition. Later, players who obtained the resources play the bidding mechanism in order to share the surplus.     

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.     

Learning to play Bayesian games

This paper discusses the implications of learning theory for the analysis of games with a move by Nature. One goal is to illuminate the issues that arise when modeling situations where players are learning about the distribution of Nature's move as well as learning about the opponents' strategies. A second goal is to argue that quite restrictive assumptions are necessary to justify the concept of Nash equilibrium without a common prior as a steady state of a learning process.     

Separating the Hawks from the Doves: Evidence from continuous time laboratory games

Human players in our laboratory experiment received flow payoffs over 120 seconds each period from a standard Hawk–Dove bimatrix game played in continuous time. Play converged closely to the symmetric mixed Nash equilibrium under a one-population matching protocol. When the same players were matched in a two-population protocol with the same bimatrix, they showed clear movement towards an asymmetric (and very inequitable) pure Nash equilibrium of the game. These findings support distinctive predictions of evolutionary game theory.     

Error cascades in observational learning: An experiment on the Chinos game

The paper reports an experimental study based on a variant of the popular Chinos game, which is used as a simple but paradigmatic instance of observational learning. There are three players, arranged in sequence,each of which wins a fixed price if she manages to guess the total number of coins lying in everybody?s hands. Our evidence shows that, despite the remarkable frequency of equilibrium outcomes, deviations from optimal play are also significant. And when such deviations occur, we find that, for any given player position, the probability of a mistake is increasing in the probability of a mistake of her predecessors. This is what we call an error cascade, which we measure by evaluating the (heterogeneous) Quantal Response Equilibrium which better suits our data. We also check the robustness of our findings when we allow for belief heterogeneity by applying Kübler and Weizsäcker?s (2004) cognitive frame of limited depth of reasoning.     

Decompositions and potentials for normal form games

A basic model of commitment is to convert a two-player game in strategic form to a “leadership game” with the same payoffs, where one player, the leader, commits to a strategy, to which the second player always chooses a best reply. This paper studies such leadership games for games with convex strategy sets. We apply them to mixed extensions of finite games, which we analyze completely, including nongeneric games. The main result is that leadership is advantageous in the sense that, as a set, the leader's payoffs in equilibrium are at least as high as his Nash and correlated equilibrium payoffs in the simultaneous game. We also consider leadership games with three or more players, where most conclusions no longer hold.     

Transferable utility games with uncertainty

We introduce the concept of a TUU-game, a transferable utility game with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferable utility game. We consider the case without ex ante commitment possibilities and propose the Weak Sequential Core as a solution concept. We characterize the Weak Sequential Core and show that it is non-empty if all ex post TU-games are convex.     

Inequality and network structure

We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itself determines the coalitions that may form. We show that if players can jointly deviate only if they form a clique in the network, then the degree of inequality that can be sustained depends on the cardinality of the maximum independent set. For bipartite networks, the size of the maximum independent set fully characterizes the degree of inequality that can be sustained. This result extends partially to general networks and to the case in which a group of players can deviate jointly if they are all sufficiently close to each other in the network.     

Improving ICANN’s governance and accountability: A policy proposal

The Internet Corporation for Assigned Names and Numbers (ICANN) has control over extremely important aspects of the Internet. Yet, its non-profit corporation status, combined with the way that it is funded and governed, make accountability a serious problem. This paper draws on the accountability framework that has been developed by Mueller (2009) to evaluate the structure and governance of ICANN and then compares it to the structure and governance of a number of other organizations that perform a roughly comparable range of coordination and standard-setting functions, to explore what might be applicable to ICANN. Virtually all of these other organizations are governed by their direct users, thereby building accountability into their structures. We suggest that this would be a good model for ICANN as well.     

Voting blocs, party discipline and party formation

I study the strategic incentives to coordinate votes in an assembly. Coalitions form voting blocs, acting as single players and affecting the policy outcome. In an assembly with two exogenous parties I show how the incentives to accept party discipline depend on the types of the agents, the sizes of the parties, and the rules the blocs use to aggregate preferences. In a game of fully endogenous party formation, I find sufficient conditions for the existence of equilibria with one bloc, two blocs, and multiple blocs.     

Geography, skills or both: What explains Fed watchers’ forecast accuracy of US monetary policy?

The paper shows that there is a substantial degree of heterogeneity in the ability of Fed watchers to forecast US monetary policy decisions. Based on a novel database for 268 individual professional forecasters since 1999, the average absolute forecast error of FOMC decisions varies 5–10 basis points between the best and worst-performers across the sample. This heterogeneity is found to be related to both the skills of analysts – such as their educational and employment backgrounds – and to geography. In particular, forecasters located in regions which experience more idiosyncratic economic conditions perform worse in anticipating monetary policy. This evidence is indicative that limited attention and heterogeneous priors are present even for anticipating important events such as monetary policy decisions.     

Forecasting the volatility of S&P depositary receipts using GARCH-type models under intraday range-based and return-based proxy measures

We employ four various GARCH-type models, incorporating the skewed generalized t (SGT) errors into those returns innovations exhibiting fat-tails, leptokurtosis and skewness to forecast both volatility and value-at-risk (VaR) for Standard & Poor's Depositary Receipts (SPDRs) from 2002 to 2008. Empirical results indicate that the asymmetric EGARCH model is the most preferable according to purely statistical loss functions. However, the mean mixed error criterion suggests that the EGARCH model facilitates option buyers for improving their trading position performance, while option sellers tend to favor the IGARCH/EGARCH model at shorter/longer trading horizon. For VaR calculations, although these GARCH-type models are likely to over-predict SPDRs' volatility, they are, nevertheless, capable of providing adequate VaR forecasts. Thus, a GARCH genre of model with SGT errors remains a useful technique for measuring and managing potential losses on SPDRs under a turbulent market scenario.     

Comment on “C.E.S. production functions in the light of the Cambridge critique”

The controversy revived in Bertram Schefold’s paper is based on three common assumptions: (1) the underlying techniques are linear (2) perfect competition obtains (3) the economy operates in a putty-putty context. The consequences of dropping these assumptions are discussed, and the relation between nonlinearity and the error due to the use of an “imprecise” production function is examined.     

On spatial equilibria in a social interaction model

Social interactions are at the essence of societies and explain the gathering of individuals in villages, agglomerations, or cities. We study the emergence of multiple agglomerations as resulting from the interplay between spatial interaction externalities and competition in the land market. We show that the geography of the spatial economy affects significantly the properties of spatial equilibria. In particular, when agents locate on an open land strip (line segment), a single city emerges in equilibrium. In contrast, when the spatial economy extends along a closed land strip (circumference), multiple equilibria with odd numbers of cities arise. Spatial equilibrium configurations involve a high degree of spatial symmetry in terms of city size and location, and can be Pareto-ranked.     

A simple and general solution to King Solomon''s problem

An indivisible object is to be allocated at no cost to the agent who values it most. We provide a simple two-stage mechanism, which implements the desired outcome when it is common knowledge that the agent who values the object most knows that. At each stage of the game, all players have weakly dominant strategies. Moreover, if the two highest valuations are common knowledge, the second stage of the game is redundant, and the outcome is implemented in weakly dominant strategies.