We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight...

Different evaluators typically disagree how to rank different candidates since they care more or less for the various qualities of the candidates. It is assumed that all evaluators submit vector bids assigning a monetary bid for each possible rank order. The rules must specify for all possible...

We introduce intention-based social preferences into a mechanism design framework with independent private values and quasilinear payoffs. For the case where the designer has no information about the intensity of social preferences, we provide conditions under which mechanisms which have been...

We introduce intention-based social preferences into mechanism design. We explore information structures that dier with respect to what is commonly known about the weight that agents attach to reciprocal kindness. When the designer has no information on reciprocity types, implementability of an...

We introduce intention-based social preferences into a Bayesian mechanism design framework. We first show that, under common knowledge of social preferences, any tension between material efficiency, incentive compatibility, and voluntary participation can be resolved. Hence, famous impossibility...

We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove convergence of the method we require a certain amount of noise in the system....

With a laboratory experiment, we study the impact of buy-options and the corresponding buy-price on revenues and bidding behavior in (online) proxy-auctions with independent private valuations. We show that temporary buy-options may reduce revenues for two reasons: At low buy-prices, the...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders' independent signals. The optimal mechanism exhibits either neutral selection, wherein the object is randomly allocated at a price that all bidders are...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We analyze the doping behavior of heterogeneous athletes in an environment of private information. In a n-player strategic game, modeled as an all-pay auction, each athlete has private information about his actual physical ability and choses the amount of performance-enhancing drugs. The use of...