The Debreu private ownership economy with complementary commodities and prices

Let E_p be a Debreu private ownership economy in which there are some complementary commodities. It means that all commodity bundles are contained in the proper subspace V   of commodity–space [R]l(l∈{1,2,…})${\mathfrak{[R]}}^l\left(l\in \left\{1,2,\dots \right\}\right)$. The production plans maximizing the producers' profits do not have to satisfy the dependency in the qualities of commodities seen in the consumers' plans. It may cause no-existence an equilibrium in economy E_p. The competitive leads, however, to adjustment the production plans to improve the consumers' satisfaction. The procedure of change the production system covering the consumers' requirements is presented. As a result, the model of the private ownership economy with complementary commodities and prices, being the simplification of the initial model, is elaborated. Consequently, the necessary condition for the existence of an equilibrium in the economy E_p is proved.     

Gender- and frame-specific audience effects in dictator games

We study dictator allocations using a 2×2$2\times 2$ experimental design that varies the level of anonymity and the choice set, allowing observation of audience effects in both give and take frames. Changes in the distribution of responses across treatment cells allow us to distinguish among alternative motives as elaborated in recent theory. We observe significant audience effects that vary by both frame and gender. The pattern of responses suggests that heterogeneous concerns for reputation and self-signaling across gender give rise to the contextual effects associated with the give and take frames that have previously been observed in the literature.     

Maxmin mechanism in a simple common value auction

This paper models the data generating process of common value auctions in a parameter-estimation way, known as the classical approach in statistical inference. Viewing the true value of the object as a parameter that nobody ever knows, we let our value function be the average of the individual estimations (signals) of all agents, a robust estimation of the parameter. Under this simple value function, we select almost uniquely the mechanism that gives the seller the largest portion of the true value in the worst situation among all the direct mechanisms that are feasible, ex-post implementable and individual rational. Our Maxmin mechanism, which randomly assigns the object to one agent, provides the seller (n−1)/n$(n-1)/n$ of the true value when expected revenue is concerned, where n$n$ is the number of the agents.     

Fictitious play in 2×n games

It is known that every discrete-time fictitious play process approaches equilibrium in nondegenerate 2×2 games, and that every continuous-time fictitious play process approaches equilibrium in nondegenerate 2×2 and 2×3 games. It has also been conjectured that convergence to the set of equilibria holds generally for nondegenerate 2×n games. We give a simple geometric proof of this for the continuous-time process, and also extend the result to discrete-time fictitious play.     

Partial identification in binary response models with nonignorable nonresponses

This study investigates the identification of parameters in semiparametric binary response models of the form y=1(x^′β+v+ε>0)$y=1(x^{\prime }\beta +v+\epsilon >0)$ when there are nonignorable nonresponses. We propose an estimation procedure for the identified set, the set of parameters that are observationally indistinguishable from the true value β$\beta$, based on the special regressor approach of Lewbel (2000). We show that the estimator for the identified set is consistent in the Hausdorff metric.     

Higher order game dynamics

Continuous-time game dynamics are typically first order systems where payoffs determine the growth rate of the players? strategy shares. In this paper, we investigate what happens beyond first order by viewing payoffs as higher order forces of change, specifying e.g. the acceleration of the players? evolution instead of its velocity (a viewpoint which emerges naturally when it comes to aggregating empirical data of past instances of play). To that end, we derive a wide class of higher order game dynamics, generalizing first order imitative dynamics, and, in particular, the replicator dynamics. We show that strictly dominated strategies become extinct in n-th order payoff-monotonic dynamics n   orders as fast as in the corresponding first order dynamics; furthermore, in stark contrast to first order, weakly dominated strategies also become extinct for n?2$n?2$. All in all, higher order payoff-monotonic dynamics lead to the elimination of weakly dominated strategies, followed by the iterated deletion of strictly dominated strategies, thus providing a dynamic justification of the well-known epistemic rationalizability process of Dekel and Fudenberg [7]. Finally, we also establish a higher order analogue of the folk theorem of evolutionary game theory, and we show that convergence to strict equilibria in n-th order dynamics is n orders as fast as in first order.     

The monetary utility premium and interpersonal comparisons

The utility premium is generally defined as the pain or reduction in expected utility caused by an n$n$th-degree risk increase, where n≥2$n\ge 2$. While it is a very useful concept in understanding a decision maker’s choice in uncertain situations, the utility premium is not interpersonally comparable. This note shows that the monetary utility premium–the utility premium divided by the expected marginal utility at the random starting wealth–is interpersonally comparable, and the comparison is characterized by Ross more risk aversion of the corresponding degree.     

Robust equilibria under non-common priors

This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogeneous priors. An equilibrium of a complete information game is robust to incomplete information under non-common priors if for every incomplete information game where each player's prior assigns high probability on the event that the players know at arbitrarily high order that the payoffs are given by the complete information game, there exists a Bayesian Nash equilibrium that generates behavior close to the equilibrium in consideration. It is shown that for generic games, an equilibrium is robust under non-common priors if and only if it is the unique rationalizable action profile. Set-valued concepts are also introduced, and for generic games, a smallest robust set is shown to exist and coincide with the set of a posteriori equilibria.     

A limit characterization of belief-free equilibrium payoffs in repeated games

The present paper studies repeated games with private monitoring, and characterizes the set of belief-free equilibrium payoffs in the limit as the discount factor approaches one and the noise on private information vanishes. Contrary to the conjecture by Ely et al. [J.C. Ely, J. Hörner, W. Olszewski, Belief-free equilibria in repeated games, Econometrica 73 (2005) 377-415], the equilibrium payoff set is computed by the same formula, no matter how many players there are. As an application of this result, a version of the folk theorem is established for N-player prisoner's dilemma games.     

Characterizing belief-free review-strategy equilibrium payoffs under conditional independence

This paper proposes and studies a tractable subset of Nash equilibria, belief-free review-strategy equilibria, in repeated games with private monitoring. The payoff set of this class of equilibria is characterized in the limit as the discount factor converges to one for games where players observe statistically independent signals. As an application, we develop a simple sufficient condition for the existence of asymptotically efficient equilibria, and establish a folk theorem for N-player prisoner?s dilemma. All these results are robust to a perturbation of the signal distribution, and hence remain true even under almost-independent monitoring.     

p-Best response set and the robustness of equilibria to incomplete information

In this paper, we use p-best response sets—a set-valued extension of p-dominance—in order to provide a new sufficient condition for the robustness of equilibria to incomplete information: if there exists a set S which is a p-best response set with , and there exists a unique correlated equilibrium μ^* whose support is in S then μ^* is a robust Nash equilibrium.     

Substituting one risk increase for another: A method for measuring risk aversion

This paper defines the rate of substitution of one stochastic change to a random variable for another. It then focuses on the case where one of these changes is an nth degree risk increase, and the other is an m  th degree risk increase, where n>m?1$n>m?1$. The paper shows that the rate of substitution for these two risk increases can be used to provide a broader definition and two additional characterizations of the nth degree Ross more risk averse partial order. The implications for local intensity measures of nth degree risk aversion are also examined. The analysis organizes the existing results as well as generates new ones.     

Mean-dispersion preferences and constant absolute uncertainty aversion

We axiomatize, in an Anscombe–Aumann framework, the class of preferences that admit a representation of the form V(f)=μ−ρ(d)$V(f)=\mu -\rho (d)$, where μ is the mean utility of the act f with respect to a given probability, d   is the vector of state-by-state utility deviations from the mean, and ρ(d)$\rho (d)$ is a measure of (aversion to) dispersion that corresponds to an uncertainty premium. The key feature of these mean-dispersion   preferences is that they exhibit constant absolute uncertainty aversion. This class includes many well-known models of preferences from the literature on ambiguity. We show what properties of the dispersion function ρ(⋅)$\rho (\cdot )$ correspond to known models, to probabilistic sophistication, and to some new notions of uncertainty aversion.     

Generalized potentials and robust sets of equilibria

This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoffs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions. These sufficient conditions unify and generalize existing sufficient conditions. Our generalization of potential games is useful in other game theoretic problems where potential methods have been applied.     

Asymmetric first-price menu auctions under intricate uncertainty

This paper studies asymmetric first-price menu auctions in the procurement environment where the buyer does not commit to a decision rule and asymmetric sellers have interdependent costs and statistically affiliated signals. Sellers compete in bidding a menu of contracts, where a contract specifies a vector of characteristics and a payment required from the buyer for delivering these characteristics. The buyer does not commit ex-ante to a decision rule but rather upon observing all the menus offered by sellers chooses the best contract. This paper establishes the existence of a continuum of separating monotone equilibria in this game bounded above by the jointly ex-post efficient outcome and below by the jointly interim efficient outcome. It shows that the jointly ex-post efficient equilibrium outcome is the only ex-post renegotiation-proof outcome and it is also ex-ante robust to all continuation equilibria.     

Belief-free equilibria in games with incomplete information: Characterization and existence

We generalize the results of Hörner and Lovo (2009) [15] to N-player games with arbitrary information structure. First, we characterize the set of belief-free equilibrium payoffs under low discounting as the set of feasible payoffs that are individually rational, jointly rational, and incentive compatible. Second, we provide necessary and sufficient conditions on the information structure for this set to be non-empty.